Base | Representation |
---|---|
bin | 1011101101101001000… |
… | …0110000110101010111 |
3 | 201020102002100120102002 |
4 | 2323122100300311113 |
5 | 11244104430314111 |
6 | 232235520105515 |
7 | 20352450344423 |
oct | 2733220606527 |
9 | 636362316362 |
10 | 201230323031 |
11 | 783832a90a1 |
12 | 32bbb76529b |
13 | 15c8c19c67a |
14 | 9a4d665b83 |
15 | 537b49e63b |
hex | 2eda430d57 |
201230323031 has 2 divisors, whose sum is σ = 201230323032. Its totient is φ = 201230323030.
The previous prime is 201230323001. The next prime is 201230323051. The reversal of 201230323031 is 130323032102.
It is an a-pointer prime, because the next prime (201230323051) can be obtained adding 201230323031 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201230323031 - 26 = 201230322967 is a prime.
It is a super-2 number, since 2×2012303230312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201230322994 and 201230323012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201230323001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100615161515 + 100615161516.
It is an arithmetic number, because the mean of its divisors is an integer number (100615161516).
Almost surely, 2201230323031 is an apocalyptic number.
201230323031 is a deficient number, since it is larger than the sum of its proper divisors (1).
201230323031 is an equidigital number, since it uses as much as digits as its factorization.
201230323031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 201230323031 its reverse (130323032102), we get a palindrome (331553355133).
The spelling of 201230323031 in words is "two hundred one billion, two hundred thirty million, three hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •