Base | Representation |
---|---|
bin | 111011100110101… |
… | …1100001101111001 |
3 | 12011101101010220012 |
4 | 1313031130031321 |
5 | 13044000342103 |
6 | 530243111305 |
7 | 100363552136 |
oct | 16715341571 |
9 | 5141333805 |
10 | 2000012153 |
11 | 936a55807 |
12 | 479972535 |
13 | 25b47ca59 |
14 | 14d89d58d |
15 | ba8b62d8 |
hex | 7735c379 |
2000012153 has 2 divisors, whose sum is σ = 2000012154. Its totient is φ = 2000012152.
The previous prime is 2000012137. The next prime is 2000012159. The reversal of 2000012153 is 3512100002.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1269283129 + 730729024 = 35627^2 + 27032^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000012153 - 24 = 2000012137 is a prime.
It is a super-2 number, since 2×20000121532 = 8000097224295390818, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2000012159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000006076 + 1000006077.
It is an arithmetic number, because the mean of its divisors is an integer number (1000006077).
Almost surely, 22000012153 is an apocalyptic number.
It is an amenable number.
2000012153 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000012153 is an equidigital number, since it uses as much as digits as its factorization.
2000012153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 14.
The square root of 2000012153 is about 44721.4954244600. The cubic root of 2000012153 is about 1259.9236018598.
Adding to 2000012153 its reverse (3512100002), we get a palindrome (5512112155).
The spelling of 2000012153 in words is "two billion, twelve thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •