Base | Representation |
---|---|
bin | 110011101111000010… |
… | …0111100100100010101 |
3 | 101121202202021211112002 |
4 | 1213132010330210111 |
5 | 3310013101133023 |
6 | 123012203005045 |
7 | 11012106411542 |
oct | 1473604744425 |
9 | 347682254462 |
10 | 111100021013 |
11 | 4313207a193 |
12 | 19647209785 |
13 | a627387307 |
14 | 553d329bc9 |
15 | 2d53984b28 |
hex | 19de13c915 |
111100021013 has 8 divisors (see below), whose sum is σ = 116950735200. Its totient is φ = 105249641328.
The previous prime is 111100021007. The next prime is 111100021033. The reversal of 111100021013 is 310120001111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111100021013 - 212 = 111100016917 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111100020985 and 111100021003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111100021033) 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 7 ways as a sum of consecutive naturals, for example, 887270 + ... + 1004712.
It is an arithmetic number, because the mean of its divisors is an integer number (14618841900).
Almost surely, 2111100021013 is an apocalyptic number.
It is an amenable number.
111100021013 is a deficient number, since it is larger than the sum of its proper divisors (5850714187).
111100021013 is a wasteful number, since it uses less digits than its factorization.
111100021013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167251.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 111100021013 its reverse (310120001111), we get a palindrome (421220022124).
The spelling of 111100021013 in words is "one hundred eleven billion, one hundred million, twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •