Base | Representation |
---|---|
bin | 1001010011000000101111… |
… | …0110111000001111011101 |
3 | 1100012020100011102202222101 |
4 | 2110300023312320033131 |
5 | 2314440102100144442 |
6 | 33424005030245101 |
7 | 2103350111464354 |
oct | 224601366701735 |
9 | 40166304382871 |
10 | 10222221099997 |
11 | 3291246355575 |
12 | 11911751b6791 |
13 | 591c4a06097a |
14 | 274a884a699b |
15 | 12ad8411bcb7 |
hex | 94c0bdb83dd |
10222221099997 has 2 divisors, whose sum is σ = 10222221099998. Its totient is φ = 10222221099996.
The previous prime is 10222221099991. The next prime is 10222221100051. The reversal of 10222221099997 is 79999012222201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9072981355321 + 1149239744676 = 3012139^2 + 1072026^2 .
It is an emirp because it is prime and its reverse (79999012222201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10222221099997 - 23 = 10222221099989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10222221099991) 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, 5111110549998 + 5111110549999.
It is an arithmetic number, because the mean of its divisors is an integer number (5111110549999).
Almost surely, 210222221099997 is an apocalyptic number.
It is an amenable number.
10222221099997 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222221099997 is an equidigital number, since it uses as much as digits as its factorization.
10222221099997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1469664, while the sum is 55.
The spelling of 10222221099997 in words is "ten trillion, two hundred twenty-two billion, two hundred twenty-one million, ninety-nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •