Base | Representation |
---|---|
bin | 1001001101001011110001… |
… | …0011100110001100000101 |
3 | 1022211122220201001211220102 |
4 | 2103102330103212030011 |
5 | 2311320031131000031 |
6 | 33310010215013445 |
7 | 2063204062060655 |
oct | 223227423461405 |
9 | 38748821054812 |
10 | 10122102203141 |
11 | 32528398a1505 |
12 | 117589366a285 |
13 | 585682a22476 |
14 | 26dcab736365 |
15 | 1284747487cb |
hex | 934bc4e6305 |
10122102203141 has 2 divisors, whose sum is σ = 10122102203142. Its totient is φ = 10122102203140.
The previous prime is 10122102203041. The next prime is 10122102203153. The reversal of 10122102203141 is 14130220122101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7436141771041 + 2685960432100 = 2726929^2 + 1638890^2 .
It is an emirp because it is prime and its reverse (14130220122101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10122102203141 - 210 = 10122102202117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10122102203041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5061051101570 + 5061051101571.
It is an arithmetic number, because the mean of its divisors is an integer number (5061051101571).
Almost surely, 210122102203141 is an apocalyptic number.
It is an amenable number.
10122102203141 is a deficient number, since it is larger than the sum of its proper divisors (1).
10122102203141 is an equidigital number, since it uses as much as digits as its factorization.
10122102203141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 10122102203141 its reverse (14130220122101), we get a palindrome (24252322325242).
The spelling of 10122102203141 in words is "ten trillion, one hundred twenty-two billion, one hundred two million, two hundred three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •