Base | Representation |
---|---|
bin | 110011101100000101… |
… | …1111110110101011101 |
3 | 101121111212100022100010 |
4 | 1213120023332311131 |
5 | 3304312301431023 |
6 | 122554312553433 |
7 | 11006466435522 |
oct | 1473013766535 |
9 | 347455308303 |
10 | 111001202013 |
11 | 43091314a99 |
12 | 1961a0b2879 |
13 | a60ca68230 |
14 | 5530165149 |
15 | 2d49e65093 |
hex | 19d82fed5d |
111001202013 has 64 divisors (see below), whose sum is σ = 170626176000. Its totient is φ = 63621904896.
The previous prime is 111001201963. The next prime is 111001202017. The reversal of 111001202013 is 310202100111.
It is not a de Polignac number, because 111001202013 - 28 = 111001201757 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111001202013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111001202017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 11800170 + ... + 11809572.
It is an arithmetic number, because the mean of its divisors is an integer number (2666034000).
Almost surely, 2111001202013 is an apocalyptic number.
111001202013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
111001202013 is a deficient number, since it is larger than the sum of its proper divisors (59624973987).
111001202013 is a wasteful number, since it uses less digits than its factorization.
111001202013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9706.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 111001202013 its reverse (310202100111), we get a palindrome (421203302124).
The spelling of 111001202013 in words is "one hundred eleven billion, one million, two hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •