Base | Representation |
---|---|
bin | 110011101100000111… |
… | …1011100110010010001 |
3 | 101121111221001111101210 |
4 | 1213120033130302101 |
5 | 3304313020023441 |
6 | 122554344250333 |
7 | 11006510243136 |
oct | 1473017346221 |
9 | 347457044353 |
10 | 111002111121 |
11 | 43091886020 |
12 | 1961a4709a9 |
13 | a60ccc5c75 |
14 | 553032058d |
15 | 2d4a094616 |
hex | 19d83dcc91 |
111002111121 has 32 divisors (see below), whose sum is σ = 163445990400. Its totient is φ = 66450444480.
The previous prime is 111002111113. The next prime is 111002111147. The reversal of 111002111121 is 121111200111.
It is not a de Polignac number, because 111002111121 - 23 = 111002111113 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 111002111097 and 111002111106.
It is not an unprimeable number, because it can be changed into a prime (111002111321) 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, 842220 + ... + 965058.
It is an arithmetic number, because the mean of its divisors is an integer number (5107687200).
Almost surely, 2111002111121 is an apocalyptic number.
111002111121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
111002111121 is a deficient number, since it is larger than the sum of its proper divisors (52443879279).
111002111121 is a wasteful number, since it uses less digits than its factorization.
111002111121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123189.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 111002111121 its reverse (121111200111), we get a palindrome (232113311232).
The spelling of 111002111121 in words is "one hundred eleven billion, two million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •