Base | Representation |
---|---|
bin | 1001010011000000000000… |
… | …0000001011110000001101 |
3 | 1100012012211022012020210021 |
4 | 2110300000000023300031 |
5 | 2314434200141300441 |
6 | 33423533203342141 |
7 | 2103342145122652 |
oct | 224600000136015 |
9 | 40165738166707 |
10 | 10222022212621 |
11 | 329115406253a |
12 | 119111a681951 |
13 | 591c17aa5c2b |
14 | 274a69cd3c29 |
15 | 12ad719323d1 |
hex | 94c0000bc0d |
10222022212621 has 2 divisors, whose sum is σ = 10222022212622. Its totient is φ = 10222022212620.
The previous prime is 10222022212531. The next prime is 10222022212697. The reversal of 10222022212621 is 12621222022201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9835280015625 + 386742196996 = 3136125^2 + 621886^2 .
It is a cyclic number.
It is not a de Polignac number, because 10222022212621 - 221 = 10222020115469 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10222022212921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111011106310 + 5111011106311.
It is an arithmetic number, because the mean of its divisors is an integer number (5111011106311).
Almost surely, 210222022212621 is an apocalyptic number.
It is an amenable number.
10222022212621 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222022212621 is an equidigital number, since it uses as much as digits as its factorization.
10222022212621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 10222022212621 its reverse (12621222022201), we get a palindrome (22843244234822).
The spelling of 10222022212621 in words is "ten trillion, two hundred twenty-two billion, twenty-two million, two hundred twelve thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •