Base | Representation |
---|---|
bin | 10000001010110011011… |
… | …011111010101001001001 |
3 | 10221012222022020221222212 |
4 | 100022303123322221021 |
5 | 121201024133031441 |
6 | 2210234322154505 |
7 | 143163251121122 |
oct | 20126333725111 |
9 | 3835868227885 |
10 | 1111112002121 |
11 | 399246838720 |
12 | 15b4111b2a35 |
13 | 80a14c89364 |
14 | 3bac71b1049 |
15 | 1dd812b5eeb |
hex | 102b36faa49 |
1111112002121 has 16 divisors (see below), whose sum is σ = 1275987556800. Its totient is φ = 956886465600.
The previous prime is 1111112002111. The next prime is 1111112002157. The reversal of 1111112002121 is 1212002111111.
It is a cyclic number.
It is not a de Polignac number, because 1111112002121 - 230 = 1110038260297 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1111112002096 and 1111112002105.
It is not an unprimeable number, because it can be changed into a prime (1111112002111) 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, 3984311 + ... + 4254051.
It is an arithmetic number, because the mean of its divisors is an integer number (79749222300).
Almost surely, 21111112002121 is an apocalyptic number.
1111112002121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1111112002121 is a deficient number, since it is larger than the sum of its proper divisors (164875554679).
1111112002121 is a wasteful number, since it uses less digits than its factorization.
1111112002121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 289480.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 1111112002121 its reverse (1212002111111), we get a palindrome (2323114113232).
The spelling of 1111112002121 in words is "one trillion, one hundred eleven billion, one hundred twelve million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •