Base | Representation |
---|---|
bin | 1010100000111101000001… |
… | …00011000100001101100101 |
3 | 10000212111012221210121220201 |
4 | 11100132200203010031211 |
5 | 11012314341120014341 |
6 | 121102155255230501 |
7 | 4604355111245224 |
oct | 520364043041545 |
9 | 100774187717821 |
10 | 23122502501221 |
11 | 740521a950062 |
12 | 2715367378431 |
13 | cb959a5c4a46 |
14 | 59d1c699ccbb |
15 | 2a1709102331 |
hex | 1507a08c4365 |
23122502501221 has 32 divisors (see below), whose sum is σ = 24052714773120. Its totient is φ = 22210810675200.
The previous prime is 23122502501213. The next prime is 23122502501237. The reversal of 23122502501221 is 12210520522132.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 23122502501221 - 23 = 23122502501213 is a prime.
It is a super-2 number, since 2×231225025012212 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23122502501221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23122502501521) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 483518250 + ... + 483566068.
It is an arithmetic number, because the mean of its divisors is an integer number (751647336660).
Almost surely, 223122502501221 is an apocalyptic number.
It is an amenable number.
23122502501221 is a deficient number, since it is larger than the sum of its proper divisors (930212271899).
23122502501221 is a wasteful number, since it uses less digits than its factorization.
23122502501221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48565.
The product of its (nonzero) digits is 4800, while the sum is 28.
The spelling of 23122502501221 in words is "twenty-three trillion, one hundred twenty-two billion, five hundred two million, five hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •