Base | Representation |
---|---|
bin | 1011101101100010001… |
… | …0100001001100001001 |
3 | 201020100001222022011202 |
4 | 2323120202201030021 |
5 | 11244030031014423 |
6 | 232233004433545 |
7 | 20351646610205 |
oct | 2733042411411 |
9 | 636301868152 |
10 | 201201423113 |
11 | 78368a5a169 |
12 | 32bb1b488b5 |
13 | 15c861c1322 |
14 | 9a498a1b05 |
15 | 5378b91728 |
hex | 2ed88a1309 |
201201423113 has 2 divisors, whose sum is σ = 201201423114. Its totient is φ = 201201423112.
The previous prime is 201201423107. The next prime is 201201423133. The reversal of 201201423113 is 311324102102.
It is an a-pointer prime, because the next prime (201201423133) can be obtained adding 201201423113 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 201194411209 + 7011904 = 448547^2 + 2648^2 .
It is a cyclic number.
It is not a de Polignac number, because 201201423113 - 220 = 201200374537 is a prime.
It is a super-2 number, since 2×2012014231132 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201201423133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100600711556 + 100600711557.
It is an arithmetic number, because the mean of its divisors is an integer number (100600711557).
Almost surely, 2201201423113 is an apocalyptic number.
It is an amenable number.
201201423113 is a deficient number, since it is larger than the sum of its proper divisors (1).
201201423113 is an equidigital number, since it uses as much as digits as its factorization.
201201423113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 201201423113 its reverse (311324102102), we get a palindrome (512525525215).
The spelling of 201201423113 in words is "two hundred one billion, two hundred one million, four hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •