Base | Representation |
---|---|
bin | 10000001010101100110… |
… | …001000101101111111001 |
3 | 10221012200111201100202210 |
4 | 100022230301011233321 |
5 | 121200312012041441 |
6 | 2210215244045333 |
7 | 143160422065164 |
oct | 20125461055771 |
9 | 3835614640683 |
10 | 1111000112121 |
11 | 399199666049 |
12 | 15b39b833849 |
13 | 809c7a41963 |
14 | 3bab63a6adb |
15 | 1dd76563616 |
hex | 102acc45bf9 |
1111000112121 has 8 divisors (see below), whose sum is σ = 1482767498080. Its totient is φ = 739949733792.
The previous prime is 1111000112099. The next prime is 1111000112137. The reversal of 1111000112121 is 1212110001111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1111000112121 - 221 = 1110998014969 is a prime.
It is a super-2 number, since 2×11110001121212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1111000112097 and 1111000112106.
It is not an unprimeable number, because it can be changed into a prime (1111000192121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 179248291 + ... + 179254488.
It is an arithmetic number, because the mean of its divisors is an integer number (185345937260).
Almost surely, 21111000112121 is an apocalyptic number.
It is an amenable number.
1111000112121 is a deficient number, since it is larger than the sum of its proper divisors (371767385959).
1111000112121 is a wasteful number, since it uses less digits than its factorization.
1111000112121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 358503815.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1111000112121 its reverse (1212110001111), we get a palindrome (2323110113232).
The spelling of 1111000112121 in words is "one trillion, one hundred eleven billion, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •