Base | Representation |
---|---|
bin | 100010011101001… |
… | …0100101110000000 |
3 | 2222120110222210110 |
4 | 1010322110232000 |
5 | 4331432434104 |
6 | 310420031320 |
7 | 40436012163 |
oct | 10472245600 |
9 | 2876428713 |
10 | 1156139904 |
11 | 54367a027 |
12 | 283232540 |
13 | 1556a896a |
14 | ad793ada |
15 | 6b774e89 |
hex | 44e94b80 |
1156139904 has 64 divisors (see below), whose sum is σ = 3105594000. Its totient is φ = 381038592.
The previous prime is 1156139903. The next prime is 1156139917. The reversal of 1156139904 is 4099316511.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×11561399042 = 2673318955242258432, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1156139903) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17262 + ... + 51090.
Almost surely, 21156139904 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 1156139904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1552797000).
1156139904 is an abundant number, since it is smaller than the sum of its proper divisors (1949454096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1156139904 is an equidigital number, since it uses as much as digits as its factorization.
1156139904 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33935 (or 33923 counting only the distinct ones).
The product of its (nonzero) digits is 29160, while the sum is 39.
The square root of 1156139904 is about 34002.0573495193. The cubic root of 1156139904 is about 1049.5507992379.
The spelling of 1156139904 in words is "one billion, one hundred fifty-six million, one hundred thirty-nine thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •