Base | Representation |
---|---|
bin | 100010101100011… |
… | …1001110010000000 |
3 | 10000010120020212002 |
4 | 1011120321302000 |
5 | 4341010443112 |
6 | 311303523132 |
7 | 40564106624 |
oct | 10530716200 |
9 | 3003506762 |
10 | 1164156032 |
11 | 548154726 |
12 | 285a594a8 |
13 | 157254530 |
14 | b087d184 |
15 | 6c30a1c2 |
hex | 45639c80 |
1164156032 has 64 divisors (see below), whose sum is σ = 2504140800. Its totient is φ = 535901184.
The previous prime is 1164156013. The next prime is 1164156061. The reversal of 1164156032 is 2306514611.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 1164155986 and 1164156004.
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, 909569 + ... + 910847.
It is an arithmetic number, because the mean of its divisors is an integer number (39127200).
Almost surely, 21164156032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1164156032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1252070400).
1164156032 is an abundant number, since it is smaller than the sum of its proper divisors (1339984768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1164156032 is a wasteful number, since it uses less digits than its factorization.
1164156032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1853 (or 1841 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 29.
The square root of 1164156032 is about 34119.7308312947. The cubic root of 1164156032 is about 1051.9709110203.
The spelling of 1164156032 in words is "one billion, one hundred sixty-four million, one hundred fifty-six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •