Base | Representation |
---|---|
bin | 110011101111000110… |
… | …0111000011000010101 |
3 | 101121202220012111202010 |
4 | 1213132030320120111 |
5 | 3310014114213023 |
6 | 123012315334433 |
7 | 11012133163641 |
oct | 1473614703025 |
9 | 347686174663 |
10 | 111102101013 |
11 | 4313326a9a2 |
12 | 19647a51419 |
13 | a627934c97 |
14 | 553d70bc21 |
15 | 2d53c46093 |
hex | 19de338615 |
111102101013 has 16 divisors (see below), whose sum is σ = 158171650560. Its totient is φ = 69200093424.
The previous prime is 111102101003. The next prime is 111102101027. The reversal of 111102101013 is 310101201111.
It is not a de Polignac number, because 111102101013 - 216 = 111102035477 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111102101013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111102101003) 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 15 ways as a sum of consecutive naturals, for example, 18720003 + ... + 18725936.
It is an arithmetic number, because the mean of its divisors is an integer number (9885728160).
Almost surely, 2111102101013 is an apocalyptic number.
It is an amenable number.
111102101013 is a deficient number, since it is larger than the sum of its proper divisors (47069549547).
111102101013 is a wasteful number, since it uses less digits than its factorization.
111102101013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37446008.
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 111102101013 its reverse (310101201111), we get a palindrome (421203302124).
The spelling of 111102101013 in words is "one hundred eleven billion, one hundred two million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •