Base | Representation |
---|---|
bin | 1001001101001000000111… |
… | …0001001011011011001001 |
3 | 1022211120101021001221112101 |
4 | 2103102001301023123021 |
5 | 2311311023221231324 |
6 | 33305324533113401 |
7 | 2063140535255413 |
oct | 223220161133311 |
9 | 38746337057471 |
10 | 10121120102089 |
11 | 3252385493447 |
12 | 117565a788861 |
13 | 585557411299 |
14 | 26dc171279b3 |
15 | 128418400944 |
hex | 93481c4b6c9 |
10121120102089 has 2 divisors, whose sum is σ = 10121120102090. Its totient is φ = 10121120102088.
The previous prime is 10121120102083. The next prime is 10121120102101. The reversal of 10121120102089 is 98020102112101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7479585023689 + 2641535078400 = 2734883^2 + 1625280^2 .
It is a cyclic number.
It is not a de Polignac number, because 10121120102089 - 211 = 10121120100041 is a prime.
It is a super-3 number, since 3×101211201020893 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (10121120102083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060560051044 + 5060560051045.
It is an arithmetic number, because the mean of its divisors is an integer number (5060560051045).
Almost surely, 210121120102089 is an apocalyptic number.
It is an amenable number.
10121120102089 is a deficient number, since it is larger than the sum of its proper divisors (1).
10121120102089 is an equidigital number, since it uses as much as digits as its factorization.
10121120102089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 28.
The spelling of 10121120102089 in words is "ten trillion, one hundred twenty-one billion, one hundred twenty million, one hundred two thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •