Base | Representation |
---|---|
bin | 10000010100000000110… |
… | …011101011000101111111 |
3 | 10222011111102021210222000 |
4 | 100110000303223011333 |
5 | 121331302000310421 |
6 | 2214551424353343 |
7 | 143663265603552 |
oct | 20240063530577 |
9 | 3864442253860 |
10 | 1121000010111 |
11 | 3a2460310453 |
12 | 161310775853 |
13 | 8192c6c4867 |
14 | 3c384500699 |
15 | 1e25e401226 |
hex | 10500ceb17f |
1121000010111 has 32 divisors (see below), whose sum is σ = 1731426174720. Its totient is φ = 716180748192.
The previous prime is 1121000010107. The next prime is 1121000010133. The reversal of 1121000010111 is 1110100001211.
It is not a de Polignac number, because 1121000010111 - 22 = 1121000010107 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1121000010093 and 1121000010102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121000010161) 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 31 ways as a sum of consecutive naturals, for example, 9047401 + ... + 9170466.
It is an arithmetic number, because the mean of its divisors is an integer number (54107067960).
Almost surely, 21121000010111 is an apocalyptic number.
1121000010111 is a deficient number, since it is larger than the sum of its proper divisors (610426164609).
1121000010111 is a wasteful number, since it uses less digits than its factorization.
1121000010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18217972 (or 18217966 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1121000010111 its reverse (1110100001211), we get a palindrome (2231100011322).
The spelling of 1121000010111 in words is "one trillion, one hundred twenty-one billion, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •