Base | Representation |
---|---|
bin | 1001001101001000011010… |
… | …1010000011110101010101 |
3 | 1022211120120222101222210102 |
4 | 2103102012222003311111 |
5 | 2311311210220401234 |
6 | 33305341023103445 |
7 | 2063142552363623 |
oct | 223220652036525 |
9 | 38746528358712 |
10 | 10121202122069 |
11 | 3252417814255 |
12 | 1175682141b85 |
13 | 58556b3cac0c |
14 | 26dc23d98513 |
15 | 128420702c7e |
hex | 93486a83d55 |
10121202122069 has 2 divisors, whose sum is σ = 10121202122070. Its totient is φ = 10121202122068.
The previous prime is 10121202121997. The next prime is 10121202122099. The reversal of 10121202122069 is 96022120212101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9861421284100 + 259780837969 = 3140290^2 + 509687^2 .
It is an emirp because it is prime and its reverse (96022120212101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10121202122069 - 240 = 9021690494293 is a prime.
It is a super-2 number, since 2×101212021220692 (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 (10121202122099) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060601061034 + 5060601061035.
It is an arithmetic number, because the mean of its divisors is an integer number (5060601061035).
Almost surely, 210121202122069 is an apocalyptic number.
It is an amenable number.
10121202122069 is a deficient number, since it is larger than the sum of its proper divisors (1).
10121202122069 is an equidigital number, since it uses as much as digits as its factorization.
10121202122069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 29.
The spelling of 10121202122069 in words is "ten trillion, one hundred twenty-one billion, two hundred two million, one hundred twenty-two thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •