Base | Representation |
---|---|
bin | 11101011101010111111… |
… | …01000010101001011001 |
3 | 10120202200010001102200121 |
4 | 32232223331002221121 |
5 | 113040442232020441 |
6 | 2052555502233241 |
7 | 133062212624551 |
oct | 16565375025131 |
9 | 3522603042617 |
10 | 1012202220121 |
11 | 3602aa846534 |
12 | 144208585821 |
13 | 745b12b4031 |
14 | 36dc2c64161 |
15 | 1b4e2b2ddd1 |
hex | ebabf42a59 |
1012202220121 has 16 divisors (see below), whose sum is σ = 1072434168000. Its totient is φ = 952684443648.
The previous prime is 1012202220097. The next prime is 1012202220167. The reversal of 1012202220121 is 1210222022101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1012202220121 - 27 = 1012202219993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1012202220095 and 1012202220104.
It is not an unprimeable number, because it can be changed into a prime (1012202220521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1733110 + ... + 2242336.
It is an arithmetic number, because the mean of its divisors is an integer number (67027135500).
Almost surely, 21012202220121 is an apocalyptic number.
It is an amenable number.
1012202220121 is a deficient number, since it is larger than the sum of its proper divisors (60231947879).
1012202220121 is a wasteful number, since it uses less digits than its factorization.
1012202220121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 509928.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1012202220121 its reverse (1210222022101), we get a palindrome (2222424242222).
The spelling of 1012202220121 in words is "one trillion, twelve billion, two hundred two million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •