Base | Representation |
---|---|
bin | 11101011011100000100… |
… | …10100010010111101001 |
3 | 10120200002100111110120121 |
4 | 32231300102202113221 |
5 | 113031420003101441 |
6 | 2052312303323241 |
7 | 133025336366206 |
oct | 16556022422751 |
9 | 3520070443517 |
10 | 1011201222121 |
11 | 35a936800962 |
12 | 143b892b0521 |
13 | 74481ab781c |
14 | 36d29d36cad |
15 | 1b484d01dd1 |
hex | eb704a25e9 |
1011201222121 has 16 divisors (see below), whose sum is σ = 1059498849024. Its totient is φ = 963266860864.
The previous prime is 1011201222089. The next prime is 1011201222131. The reversal of 1011201222121 is 1212221021101.
1011201222121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1011201222121 - 25 = 1011201222089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1011201222095 and 1011201222104.
It is not an unprimeable number, because it can be changed into a prime (1011201222131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21492795 + ... + 21539791.
It is an arithmetic number, because the mean of its divisors is an integer number (66218678064).
Almost surely, 21011201222121 is an apocalyptic number.
It is an amenable number.
1011201222121 is a deficient number, since it is larger than the sum of its proper divisors (48297626903).
1011201222121 is a wasteful number, since it uses less digits than its factorization.
1011201222121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50840.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1011201222121 its reverse (1212221021101), we get a palindrome (2223422243222).
The spelling of 1011201222121 in words is "one trillion, eleven billion, two hundred one million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •