Base | Representation |
---|---|
bin | 1010011110000100000110… |
… | …11100100110101001101001 |
3 | 10000111222222111010002002102 |
4 | 11033002003130212221221 |
5 | 11004203033341121301 |
6 | 120544420441343145 |
7 | 4564242050134265 |
oct | 517020334465151 |
9 | 100458874102072 |
10 | 23023230020201 |
11 | 737710814a814 |
12 | 26ba081197ab5 |
13 | cb010973b308 |
14 | 59848a3db0a5 |
15 | 29dd48bc3b6b |
hex | 14f083726a69 |
23023230020201 has 2 divisors, whose sum is σ = 23023230020202. Its totient is φ = 23023230020200.
The previous prime is 23023230020159. The next prime is 23023230020221. The reversal of 23023230020201 is 10202003232032.
It is an a-pointer prime, because the next prime (23023230020221) can be obtained adding 23023230020201 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20633806578025 + 2389423442176 = 4542445^2 + 1545776^2 .
It is a cyclic number.
It is not a de Polignac number, because 23023230020201 - 226 = 23023162911337 is a prime.
It is not a weakly prime, because it can be changed into another prime (23023230020221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11511615010100 + 11511615010101.
It is an arithmetic number, because the mean of its divisors is an integer number (11511615010101).
Almost surely, 223023230020201 is an apocalyptic number.
It is an amenable number.
23023230020201 is a deficient number, since it is larger than the sum of its proper divisors (1).
23023230020201 is an equidigital number, since it uses as much as digits as its factorization.
23023230020201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 23023230020201 its reverse (10202003232032), we get a palindrome (33225233252233).
The spelling of 23023230020201 in words is "twenty-three trillion, twenty-three billion, two hundred thirty million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •