Base | Representation |
---|---|
bin | 11000001111001001… |
… | …11000110001001111 |
3 | 1020120211101200222111 |
4 | 30013210320301033 |
5 | 203122033341421 |
6 | 5551100324451 |
7 | 640310164240 |
oct | 140744706117 |
9 | 36524350874 |
10 | 13012012111 |
11 | 5577a3a31a |
12 | 2631843727 |
13 | 12c4a19367 |
14 | 8b61b4cc7 |
15 | 512525ee1 |
hex | 307938c4f |
13012012111 has 16 divisors (see below), whose sum is σ = 15936827904. Its totient is φ = 10379898144.
The previous prime is 13012012099. The next prime is 13012012141. The reversal of 13012012111 is 11121021031.
It is a happy number.
13012012111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13012012111 - 213 = 13012003919 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13012012091 and 13012012100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13012012141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1086205 + ... + 1098118.
It is an arithmetic number, because the mean of its divisors is an integer number (996051744).
Almost surely, 213012012111 is an apocalyptic number.
13012012111 is a deficient number, since it is larger than the sum of its proper divisors (2924815793).
13012012111 is a wasteful number, since it uses less digits than its factorization.
13012012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2184390.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 13012012111 its reverse (11121021031), we get a palindrome (24133033142).
The spelling of 13012012111 in words is "thirteen billion, twelve million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •