Base | Representation |
---|---|
bin | 11000010000001001… |
… | …00010111001001000 |
3 | 1020121102000100001220 |
4 | 30020010202321020 |
5 | 203131144423422 |
6 | 5551554242040 |
7 | 640440550464 |
oct | 141004427110 |
9 | 36542010056 |
10 | 13020311112 |
11 | 55816984a6 |
12 | 2634586320 |
13 | 12c6663903 |
14 | 8b73354a4 |
15 | 513114e5c |
hex | 308122e48 |
13020311112 has 32 divisors (see below), whose sum is σ = 33243350400. Its totient is φ = 4247760704.
The previous prime is 13020311099. The next prime is 13020311113. The reversal of 13020311112 is 21111302031.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 13020311091 and 13020311100.
It is not an unprimeable number, because it can be changed into a prime (13020311113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5770287 + ... + 5772542.
It is an arithmetic number, because the mean of its divisors is an integer number (1038854700).
Almost surely, 213020311112 is an apocalyptic number.
13020311112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13020311112 is an abundant number, since it is smaller than the sum of its proper divisors (20223039288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13020311112 is a wasteful number, since it uses less digits than its factorization.
13020311112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11542885 (or 11542881 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 13020311112 its reverse (21111302031), we get a palindrome (34131613143).
The spelling of 13020311112 in words is "thirteen billion, twenty million, three hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •