Base | Representation |
---|---|
bin | 10101101101011100… |
… | …011111100000101001 |
3 | 2020011120210121201200 |
4 | 111231130133200221 |
5 | 340220110201441 |
6 | 14413044034413 |
7 | 1453445263422 |
oct | 255534374051 |
9 | 66146717650 |
10 | 23311022121 |
11 | 9982511a42 |
12 | 4626992a09 |
13 | 2276648b1a |
14 | 11b1d30649 |
15 | 9167997b6 |
hex | 56d71f829 |
23311022121 has 12 divisors (see below), whose sum is σ = 34832562180. Its totient is φ = 15004795680.
The previous prime is 23311022113. The next prime is 23311022131. The reversal of 23311022121 is 12122011332.
It can be written as a sum of positive squares in 2 ways, for example, as 15734190096 + 7576832025 = 125436^2 + 87045^2 .
It is not a de Polignac number, because 23311022121 - 23 = 23311022113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23311022094 and 23311022103.
It is not an unprimeable number, because it can be changed into a prime (23311022131) 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 in 11 ways as a sum of consecutive naturals, for example, 44656870 + ... + 44657391.
It is an arithmetic number, because the mean of its divisors is an integer number (2902713515).
Almost surely, 223311022121 is an apocalyptic number.
It is an amenable number.
23311022121 is a deficient number, since it is larger than the sum of its proper divisors (11521540059).
23311022121 is a wasteful number, since it uses less digits than its factorization.
23311022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89314296 (or 89314293 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 23311022121 its reverse (12122011332), we get a palindrome (35433033453).
The spelling of 23311022121 in words is "twenty-three billion, three hundred eleven million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •