Base | Representation |
---|---|
bin | 11000011010110101… |
… | …01011100111101111 |
3 | 1020211122210000020200 |
4 | 30031122223213233 |
5 | 203322130000421 |
6 | 10004520444543 |
7 | 642610106445 |
oct | 141532534757 |
9 | 36748700220 |
10 | 13110000111 |
11 | 561828713a |
12 | 265a619753 |
13 | 130c107120 |
14 | 8c5200b95 |
15 | 51ae2e726 |
hex | 30d6ab9ef |
13110000111 has 12 divisors (see below), whose sum is σ = 20393333688. Its totient is φ = 8067692304.
The previous prime is 13110000107. The next prime is 13110000121. The reversal of 13110000111 is 11100001131.
It is not a de Polignac number, because 13110000111 - 22 = 13110000107 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 13110000093 and 13110000102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110000121) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 56025525 + ... + 56025758.
It is an arithmetic number, because the mean of its divisors is an integer number (1699444474).
Almost surely, 213110000111 is an apocalyptic number.
13110000111 is a deficient number, since it is larger than the sum of its proper divisors (7283333577).
13110000111 is a wasteful number, since it uses less digits than its factorization.
13110000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112051302 (or 112051299 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 13110000111 its reverse (11100001131), we get a palindrome (24210001242).
The spelling of 13110000111 in words is "thirteen billion, one hundred ten million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •