Base | Representation |
---|---|
bin | 10110110010000111011101… |
… | …101010101110001000011001 |
3 | 111010210010022201222221200111 |
4 | 112302013131222232020121 |
5 | 101113143132304341441 |
6 | 553035413050204321 |
7 | 30051166314433405 |
oct | 2662073552561031 |
9 | 433703281887614 |
10 | 100201011012121 |
11 | 29a22012532788 |
12 | b2a3763a236a1 |
13 | 43babb7a59736 |
14 | 1aa5a7d2aa105 |
15 | b8b6d189d081 |
hex | 5b21ddaae219 |
100201011012121 has 2 divisors, whose sum is σ = 100201011012122. Its totient is φ = 100201011012120.
The previous prime is 100201011012029. The next prime is 100201011012191. The reversal of 100201011012121 is 121210110102001.
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., 99223214377225 + 977796634896 = 9961085^2 + 988836^2 .
It is an emirp because it is prime and its reverse (121210110102001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100201011012121 - 29 = 100201011011609 is a prime.
It is not a weakly prime, because it can be changed into another prime (100201011012191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50100505506060 + 50100505506061.
It is an arithmetic number, because the mean of its divisors is an integer number (50100505506061).
Almost surely, 2100201011012121 is an apocalyptic number.
It is an amenable number.
100201011012121 is a deficient number, since it is larger than the sum of its proper divisors (1).
100201011012121 is an equidigital number, since it uses as much as digits as its factorization.
100201011012121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100201011012121 its reverse (121210110102001), we get a palindrome (221411121114122).
The spelling of 100201011012121 in words is "one hundred trillion, two hundred one billion, eleven million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •