Base | Representation |
---|---|
bin | 100001110011101010000… |
… | …111101001001101111101 |
3 | 22020002121111212211020212 |
4 | 201303222013221031331 |
5 | 301030413303242341 |
6 | 4535133521322205 |
7 | 326563212656543 |
oct | 41635207511575 |
9 | 8202544784225 |
10 | 2323210212221 |
11 | 8162a4665058 |
12 | 316306496365 |
13 | 13b101b73762 |
14 | 8063039dd93 |
15 | 406731715eb |
hex | 21cea1e937d |
2323210212221 has 2 divisors, whose sum is σ = 2323210212222. Its totient is φ = 2323210212220.
The previous prime is 2323210212187. The next prime is 2323210212227. The reversal of 2323210212221 is 1222120123232.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2149830412900 + 173379799321 = 1466230^2 + 416389^2 .
It is a cyclic number.
It is not a de Polignac number, because 2323210212221 - 234 = 2306030343037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2323210212227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1161605106110 + 1161605106111.
It is an arithmetic number, because the mean of its divisors is an integer number (1161605106111).
Almost surely, 22323210212221 is an apocalyptic number.
It is an amenable number.
2323210212221 is a deficient number, since it is larger than the sum of its proper divisors (1).
2323210212221 is an equidigital number, since it uses as much as digits as its factorization.
2323210212221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 2323210212221 its reverse (1222120123232), we get a palindrome (3545330335453).
The spelling of 2323210212221 in words is "two trillion, three hundred twenty-three billion, two hundred ten million, two hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •