Base | Representation |
---|---|
bin | 10110101111010101100101… |
… | …110010011100111101100001 |
3 | 111010002212100022222211210202 |
4 | 112233111211302130331201 |
5 | 101102031010412241001 |
6 | 552411545224034545 |
7 | 30031325362061615 |
oct | 2657254562347541 |
9 | 433085308884722 |
10 | 100010021212001 |
11 | 2995901479a06a |
12 | b272741902a55 |
13 | 43a5b9b34c3a4 |
14 | 1a9a721ad7345 |
15 | b8675446c96b |
hex | 5af565c9cf61 |
100010021212001 has 2 divisors, whose sum is σ = 100010021212002. Its totient is φ = 100010021212000.
The previous prime is 100010021211979. The next prime is 100010021212019. The reversal of 100010021212001 is 100212120010001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96192921224401 + 3817099987600 = 9807799^2 + 1953740^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100010021212001 is a prime.
It is a super-3 number, since 3×1000100212120013 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (100010021272001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005010606000 + 50005010606001.
It is an arithmetic number, because the mean of its divisors is an integer number (50005010606001).
Almost surely, 2100010021212001 is an apocalyptic number.
It is an amenable number.
100010021212001 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010021212001 is an equidigital number, since it uses as much as digits as its factorization.
100010021212001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100010021212001 its reverse (100212120010001), we get a palindrome (200222141222002).
The spelling of 100010021212001 in words is "one hundred trillion, ten billion, twenty-one million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •