Base | Representation |
---|---|
bin | 1001001101001000000101… |
… | …0110011110001111101001 |
3 | 1022211120100202220021020111 |
4 | 2103102001112132033221 |
5 | 2311311014423220124 |
6 | 33305324123054321 |
7 | 2063140421620051 |
oct | 223220126361751 |
9 | 38746322807214 |
10 | 10121113101289 |
11 | 3252381541663 |
12 | 11756583713a1 |
13 | 585555b2c8b8 |
14 | 26dc16224561 |
15 | 1284179bb494 |
hex | 9348159e3e9 |
10121113101289 has 2 divisors, whose sum is σ = 10121113101290. Its totient is φ = 10121113101288.
The previous prime is 10121113101139. The next prime is 10121113101311. The reversal of 10121113101289 is 98210131112101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8971911949225 + 1149201152064 = 2995315^2 + 1072008^2 .
It is an emirp because it is prime and its reverse (98210131112101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10121113101289 - 217 = 10121112970217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10121113101289.
It is not a weakly prime, because it can be changed into another prime (10121113191289) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060556550644 + 5060556550645.
It is an arithmetic number, because the mean of its divisors is an integer number (5060556550645).
Almost surely, 210121113101289 is an apocalyptic number.
It is an amenable number.
10121113101289 is a deficient number, since it is larger than the sum of its proper divisors (1).
10121113101289 is an equidigital number, since it uses as much as digits as its factorization.
10121113101289 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 31.
The spelling of 10121113101289 in words is "ten trillion, one hundred twenty-one billion, one hundred thirteen million, one hundred one thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •