Base | Representation |
---|---|
bin | 10000000000100100011… |
… | …001001001110000100001 |
3 | 10220011121102000020011012 |
4 | 100000210121021300201 |
5 | 121011022240413441 |
6 | 2201220020430305 |
7 | 142324024264016 |
oct | 20004431116041 |
9 | 3804542006135 |
10 | 1100122201121 |
11 | 394617336559 |
12 | 159264848395 |
13 | 7c9831c3028 |
14 | 3b3637d770d |
15 | 1d93b58d9eb |
hex | 10024649c21 |
1100122201121 has 16 divisors (see below), whose sum is σ = 1134866204928. Its totient is φ = 1065854592000.
The previous prime is 1100122201117. The next prime is 1100122201153. The reversal of 1100122201121 is 1211022210011.
It is a cyclic number.
It is not a de Polignac number, because 1100122201121 - 22 = 1100122201117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100122201096 and 1100122201105.
It is not an unprimeable number, because it can be changed into a prime (1100122201921) 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, 29464961 + ... + 29502273.
It is an arithmetic number, because the mean of its divisors is an integer number (70929137808).
Almost surely, 21100122201121 is an apocalyptic number.
It is an amenable number.
1100122201121 is a deficient number, since it is larger than the sum of its proper divisors (34744003807).
1100122201121 is a wasteful number, since it uses less digits than its factorization.
1100122201121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43672.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1100122201121 its reverse (1211022210011), we get a palindrome (2311144411132).
It can be divided in two parts, 1100 and 122201121, that added together give a palindrome (122202221).
The spelling of 1100122201121 in words is "one trillion, one hundred billion, one hundred twenty-two million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •