Base | Representation |
---|---|
bin | 10110101111001100011100… |
… | …011110001010011111101001 |
3 | 111010001220222221221200010212 |
4 | 112233030130132022133221 |
5 | 101101400403003101441 |
6 | 552403242551350505 |
7 | 30030530131406534 |
oct | 2657143436123751 |
9 | 433056887850125 |
10 | 100000201222121 |
11 | 29954935654352 |
12 | b270861082435 |
13 | 43a4c94a3a5a5 |
14 | 1a9a06d831a1b |
15 | b8637c2baeeb |
hex | 5af31c78a7e9 |
100000201222121 has 2 divisors, whose sum is σ = 100000201222122. Its totient is φ = 100000201222120.
The previous prime is 100000201222063. The next prime is 100000201222139. The reversal of 100000201222121 is 121222102000001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90018140108521 + 9982061113600 = 9487789^2 + 3159440^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100000201222121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100000201222096 and 100000201222105.
It is not a weakly prime, because it can be changed into another prime (100000201222321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000100611060 + 50000100611061.
It is an arithmetic number, because the mean of its divisors is an integer number (50000100611061).
Almost surely, 2100000201222121 is an apocalyptic number.
It is an amenable number.
100000201222121 is a deficient number, since it is larger than the sum of its proper divisors (1).
100000201222121 is an equidigital number, since it uses as much as digits as its factorization.
100000201222121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 100000201222121 its reverse (121222102000001), we get a palindrome (221222303222122).
The spelling of 100000201222121 in words is "one hundred trillion, two hundred one million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •