Base | Representation |
---|---|
bin | 11000001111001010… |
… | …10001001011110000 |
3 | 1020120211120210011020 |
4 | 30013211101023300 |
5 | 203122100041422 |
6 | 5551102415440 |
7 | 640311061626 |
oct | 140745211360 |
9 | 36524523136 |
10 | 13012112112 |
11 | 5577aa846a |
12 | 2631891580 |
13 | 12c4a52a2c |
14 | 8b61dd516 |
15 | 51254595c |
hex | 3079512f0 |
13012112112 has 80 divisors (see below), whose sum is σ = 34729777152. Its totient is φ = 4193729280.
The previous prime is 13012112077. The next prime is 13012112117. The reversal of 13012112112 is 21121121031.
It is a junction number, because it is equal to n+sod(n) for n = 13012112091 and 13012112100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13012112117) 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, 2030898 + ... + 2037294.
Almost surely, 213012112112 is an apocalyptic number.
13012112112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13012112112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17364888576).
13012112112 is an abundant number, since it is smaller than the sum of its proper divisors (21717665040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13012112112 is a wasteful number, since it uses less digits than its factorization.
13012112112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7806 (or 7800 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 13012112112 its reverse (21121121031), we get a palindrome (34133233143).
The spelling of 13012112112 in words is "thirteen billion, twelve million, one hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •