Base | Representation |
---|---|
bin | 1001000110000101010110… |
… | …1011000100110001000001 |
3 | 1022102000001122022212121222 |
4 | 2101201111223010301001 |
5 | 2302320222013021121 |
6 | 33133554155124425 |
7 | 2051325216606662 |
oct | 221412553046101 |
9 | 38360048285558 |
10 | 10000121220161 |
11 | 32060337a9576 |
12 | 1156110443715 |
13 | 5770132bb927 |
14 | 268019285369 |
15 | 1251d58da0ab |
hex | 91855ac4c41 |
10000121220161 has 2 divisors, whose sum is σ = 10000121220162. Its totient is φ = 10000121220160.
The previous prime is 10000121220113. The next prime is 10000121220217. The reversal of 10000121220161 is 16102212100001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7703017235761 + 2297103984400 = 2775431^2 + 1515620^2 .
It is a cyclic number.
It is not a de Polignac number, because 10000121220161 - 230 = 9999047478337 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10000121520161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000060610080 + 5000060610081.
It is an arithmetic number, because the mean of its divisors is an integer number (5000060610081).
Almost surely, 210000121220161 is an apocalyptic number.
It is an amenable number.
10000121220161 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000121220161 is an equidigital number, since it uses as much as digits as its factorization.
10000121220161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 10000121220161 its reverse (16102212100001), we get a palindrome (26102333320162).
The spelling of 10000121220161 in words is "ten trillion, one hundred twenty-one million, two hundred twenty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •