Base | Representation |
---|---|
bin | 110011101111000110… |
… | …0100010011010000101 |
3 | 101121202220000221021210 |
4 | 1213132030202122011 |
5 | 3310014103323023 |
6 | 123012313402033 |
7 | 11012132340360 |
oct | 1473614423205 |
9 | 347686027253 |
10 | 111102011013 |
11 | 43133209314 |
12 | 19647a09319 |
13 | a627903026 |
14 | 553d6c70d7 |
15 | 2d53c29593 |
hex | 19de322685 |
111102011013 has 16 divisors (see below), whose sum is σ = 169523757056. Its totient is φ = 63402318000.
The previous prime is 111102010967. The next prime is 111102011017. The reversal of 111102011013 is 310110201111.
It is not a de Polignac number, because 111102011013 - 26 = 111102010949 is a prime.
It is a super-2 number, since 2×1111020110132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 111102011013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111102011017) 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, 3506581 + ... + 3538122.
It is an arithmetic number, because the mean of its divisors is an integer number (10595234816).
Almost surely, 2111102011013 is an apocalyptic number.
It is an amenable number.
111102011013 is a deficient number, since it is larger than the sum of its proper divisors (58421746043).
111102011013 is an equidigital number, since it uses as much as digits as its factorization.
111102011013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7045464.
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 111102011013 its reverse (310110201111), we get a palindrome (421212212124).
The spelling of 111102011013 in words is "one hundred eleven billion, one hundred two million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •