Base | Representation |
---|---|
bin | 11101011101011000111… |
… | …10111101100010111001 |
3 | 10120202200201210012012221 |
4 | 32232230132331202321 |
5 | 113041002021041441 |
6 | 2053000421004041 |
7 | 133062351331006 |
oct | 16565436754271 |
9 | 3522621705187 |
10 | 1012211112121 |
11 | 36030486a1a0 |
12 | 14420b553621 |
13 | 745b30a8481 |
14 | 36dc40da8ad |
15 | 1b4e37d88d1 |
hex | ebac7bd8b9 |
1012211112121 has 32 divisors (see below), whose sum is σ = 1164477214080. Its totient is φ = 870165504000.
The previous prime is 1012211112119. The next prime is 1012211112217. The reversal of 1012211112121 is 1212111122101.
It is a cyclic number.
It is not a de Polignac number, because 1012211112121 - 21 = 1012211112119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1012211112095 and 1012211112104.
It is not an unprimeable number, because it can be changed into a prime (1012211112721) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 470138781 + ... + 470140933.
It is an arithmetic number, because the mean of its divisors is an integer number (36389912940).
Almost surely, 21012211112121 is an apocalyptic number.
1012211112121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1012211112121 is a deficient number, since it is larger than the sum of its proper divisors (152266101959).
1012211112121 is a wasteful number, since it uses less digits than its factorization.
1012211112121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5257.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 1012211112121 its reverse (1212111122101), we get a palindrome (2224322234222).
The spelling of 1012211112121 in words is "one trillion, twelve billion, two hundred eleven million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •