Base | Representation |
---|---|
bin | 100001101111111… |
… | …0001101100000000 |
3 | 2220220211001111202 |
4 | 1003133301230000 |
5 | 4304343402311 |
6 | 304211200332 |
7 | 40030161542 |
oct | 10337615400 |
9 | 2826731452 |
10 | 1132403456 |
11 | 531237528 |
12 | 2772a60a8 |
13 | 1507b7922 |
14 | aa575692 |
15 | 69636e3b |
hex | 437f1b00 |
1132403456 has 72 divisors (see below), whose sum is σ = 2403253440. Its totient is φ = 530694144.
The previous prime is 1132403449. The next prime is 1132403471. The reversal of 1132403456 is 6543042311.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1596830 + ... + 1597538.
It is an arithmetic number, because the mean of its divisors is an integer number (33378520).
Almost surely, 21132403456 is an apocalyptic number.
1132403456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1132403456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1201626720).
1132403456 is an abundant number, since it is smaller than the sum of its proper divisors (1270849984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1132403456 is an equidigital number, since it uses as much as digits as its factorization.
1132403456 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1109 (or 1095 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 29.
The square root of 1132403456 is about 33651.2028908329. The cubic root of 1132403456 is about 1042.3183783037.
Adding to 1132403456 its reverse (6543042311), we get a palindrome (7675445767).
The spelling of 1132403456 in words is "one billion, one hundred thirty-two million, four hundred three thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •