Base | Representation |
---|---|
bin | 1010100011100010011110… |
… | …00101111101111100111001 |
3 | 10001011222111111211220010222 |
4 | 11101301033011331330321 |
5 | 11020243301014411441 |
6 | 121211045441545425 |
7 | 4613651254431503 |
oct | 521611705757471 |
9 | 101158444756128 |
10 | 23211330232121 |
11 | 7439962886009 |
12 | 272a617645275 |
13 | cc4a855b1a65 |
14 | 5a3611d08d73 |
15 | 2a3ba75bed4b |
hex | 151c4f17df39 |
23211330232121 has 2 divisors, whose sum is σ = 23211330232122. Its totient is φ = 23211330232120.
The previous prime is 23211330232067. The next prime is 23211330232159. The reversal of 23211330232121 is 12123203311232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17670791024896 + 5540539207225 = 4203664^2 + 2353835^2 .
It is a cyclic number.
It is not a de Polignac number, because 23211330232121 - 210 = 23211330231097 is a prime.
It is a super-2 number, since 2×232113302321212 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (23211330231121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11605665116060 + 11605665116061.
It is an arithmetic number, because the mean of its divisors is an integer number (11605665116061).
Almost surely, 223211330232121 is an apocalyptic number.
It is an amenable number.
23211330232121 is a deficient number, since it is larger than the sum of its proper divisors (1).
23211330232121 is an equidigital number, since it uses as much as digits as its factorization.
23211330232121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 23211330232121 its reverse (12123203311232), we get a palindrome (35334533543353).
The spelling of 23211330232121 in words is "twenty-three trillion, two hundred eleven billion, three hundred thirty million, two hundred thirty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •