Base | Representation |
---|---|
bin | 101110101010100111… |
… | …1110000100001110101 |
3 | 100120200010011010111202 |
4 | 1131111033300201311 |
5 | 3120214344121401 |
6 | 114012103142245 |
7 | 10145256463064 |
oct | 1352517604165 |
9 | 316603133452 |
10 | 100214442101 |
11 | 39556492684 |
12 | 17509744985 |
13 | 95b1082467 |
14 | 4bc97221db |
15 | 2917e9806b |
hex | 17553f0875 |
100214442101 has 2 divisors, whose sum is σ = 100214442102. Its totient is φ = 100214442100.
The previous prime is 100214442007. The next prime is 100214442149. The reversal of 100214442101 is 101244412001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83955642001 + 16258800100 = 289751^2 + 127510^2 .
It is an emirp because it is prime and its reverse (101244412001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100214442101 - 230 = 99140700277 is a prime.
It is a super-2 number, since 2×1002144421012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100214442401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50107221050 + 50107221051.
It is an arithmetic number, because the mean of its divisors is an integer number (50107221051).
Almost surely, 2100214442101 is an apocalyptic number.
It is an amenable number.
100214442101 is a deficient number, since it is larger than the sum of its proper divisors (1).
100214442101 is an equidigital number, since it uses as much as digits as its factorization.
100214442101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 100214442101 its reverse (101244412001), we get a palindrome (201458854102).
The spelling of 100214442101 in words is "one hundred billion, two hundred fourteen million, four hundred forty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •