Base | Representation |
---|---|
bin | 1001001101001100001000… |
… | …1100111001100111100101 |
3 | 1022211200011121011212222221 |
4 | 2103103002030321213211 |
5 | 2311320231441023023 |
6 | 33310024110552341 |
7 | 2063206402554055 |
oct | 223230214714745 |
9 | 38750147155887 |
10 | 10122201111013 |
11 | 325288a707452 |
12 | 11759008086b1 |
13 | 58569a372b34 |
14 | 26dcba921565 |
15 | 12847d28485d |
hex | 934c23399e5 |
10122201111013 has 2 divisors, whose sum is σ = 10122201111014. Its totient is φ = 10122201111012.
The previous prime is 10122201110977. The next prime is 10122201111059. The reversal of 10122201111013 is 31011110222101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5335351586244 + 4786849524769 = 2309838^2 + 2187887^2 .
It is a cyclic number.
It is not a de Polignac number, because 10122201111013 - 233 = 10113611176421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10122201111083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5061100555506 + 5061100555507.
It is an arithmetic number, because the mean of its divisors is an integer number (5061100555507).
Almost surely, 210122201111013 is an apocalyptic number.
It is an amenable number.
10122201111013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10122201111013 is an equidigital number, since it uses as much as digits as its factorization.
10122201111013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 10122201111013 its reverse (31011110222101), we get a palindrome (41133311333114).
The spelling of 10122201111013 in words is "ten trillion, one hundred twenty-two billion, two hundred one million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •