Base | Representation |
---|---|
bin | 10000001001111000010… |
… | …111100011010011100011 |
3 | 10221010102020111221200111 |
4 | 100021320113203103203 |
5 | 121142011434032321 |
6 | 2205552121432151 |
7 | 143126555553424 |
oct | 20117027432343 |
9 | 3833366457614 |
10 | 1110121002211 |
11 | 398888401831 |
12 | 15b19533b657 |
13 | 808b7880890 |
14 | 3ba3172764b |
15 | 1dd242b15e1 |
hex | 102785e34e3 |
1110121002211 has 64 divisors (see below), whose sum is σ = 1330483190400. Its totient is φ = 916798611456.
The previous prime is 1110121002203. The next prime is 1110121002281. The reversal of 1110121002211 is 1122001210111.
It is a happy number.
It is not a de Polignac number, because 1110121002211 - 23 = 1110121002203 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 1110121002191 and 1110121002200.
It is not an unprimeable number, because it can be changed into a prime (1110121002281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 127934005 + ... + 127942681.
It is an arithmetic number, because the mean of its divisors is an integer number (20788799850).
Almost surely, 21110121002211 is an apocalyptic number.
1110121002211 is a deficient number, since it is larger than the sum of its proper divisors (220362188189).
1110121002211 is a wasteful number, since it uses less digits than its factorization.
1110121002211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9128.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1110121002211 its reverse (1122001210111), we get a palindrome (2232122212322).
The spelling of 1110121002211 in words is "one trillion, one hundred ten billion, one hundred twenty-one million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •