Base | Representation |
---|---|
bin | 1001001101001011011101… |
… | …1110001101101001001101 |
3 | 1022211122201001110101110102 |
4 | 2103102313132031221031 |
5 | 2311314344400200414 |
6 | 33305554200420445 |
7 | 2063202055521662 |
oct | 223226736155115 |
9 | 38748631411412 |
10 | 10122021100109 |
11 | 32527a8037606 |
12 | 1175870477725 |
13 | 58566bc96cc9 |
14 | 26dca0a63a69 |
15 | 12846c577ede |
hex | 934b778da4d |
10122021100109 has 2 divisors, whose sum is σ = 10122021100110. Its totient is φ = 10122021100108.
The previous prime is 10122021100067. The next prime is 10122021100133. The reversal of 10122021100109 is 90100112022101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7043477142025 + 3078543958084 = 2653955^2 + 1754578^2 .
It is an emirp because it is prime and its reverse (90100112022101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10122021100109 is a prime.
It is a super-2 number, since 2×101220211001092 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10122021100409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5061010550054 + 5061010550055.
It is an arithmetic number, because the mean of its divisors is an integer number (5061010550055).
Almost surely, 210122021100109 is an apocalyptic number.
It is an amenable number.
10122021100109 is a deficient number, since it is larger than the sum of its proper divisors (1).
10122021100109 is an equidigital number, since it uses as much as digits as its factorization.
10122021100109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 10122021100109 in words is "ten trillion, one hundred twenty-two billion, twenty-one million, one hundred thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •