Base | Representation |
---|---|
bin | 1001010010111100101001… |
… | …0011001000111001011111 |
3 | 1100012010111111210200021212 |
4 | 2110233022103020321133 |
5 | 2314430324012240444 |
6 | 33423303540015035 |
7 | 2103310624545665 |
oct | 224571223107137 |
9 | 40163444720255 |
10 | 10221121211999 |
11 | 3290831507425 |
12 | 1190b0899147b |
13 | 591b0321bc79 |
14 | 2749c2396c35 |
15 | 12ad1c7a919e |
hex | 94bca4c8e5f |
10221121211999 has 2 divisors, whose sum is σ = 10221121212000. Its totient is φ = 10221121211998.
The previous prime is 10221121211969. The next prime is 10221121212011. The reversal of 10221121211999 is 99911212112201.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10221121211999 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10221121211969) 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, 5110560605999 + 5110560606000.
It is an arithmetic number, because the mean of its divisors is an integer number (5110560606000).
Almost surely, 210221121211999 is an apocalyptic number.
10221121211999 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221121211999 is an equidigital number, since it uses as much as digits as its factorization.
10221121211999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 41.
The spelling of 10221121211999 in words is "ten trillion, two hundred twenty-one billion, one hundred twenty-one million, two hundred eleven thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •