Base | Representation |
---|---|
bin | 11000011101001110… |
… | …11001110000001100 |
3 | 1020220001121210120220 |
4 | 30032213121300030 |
5 | 203342302041022 |
6 | 10010515511340 |
7 | 643243052643 |
oct | 141647316014 |
9 | 36801553526 |
10 | 13130112012 |
11 | 5628673546 |
12 | 26652b8550 |
13 | 1313329464 |
14 | 8c7b5835a |
15 | 51caa385c |
hex | 30e9d9c0c |
13130112012 has 12 divisors (see below), whose sum is σ = 30636928056. Its totient is φ = 4376704000.
The previous prime is 13130112011. The next prime is 13130112029. The reversal of 13130112012 is 21021103131.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 13130111982 and 13130112000.
It is not an unprimeable number, because it can be changed into a prime (13130112011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 547087989 + ... + 547088012.
It is an arithmetic number, because the mean of its divisors is an integer number (2553077338).
Almost surely, 213130112012 is an apocalyptic number.
13130112012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13130112012 is an abundant number, since it is smaller than the sum of its proper divisors (17506816044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13130112012 is a wasteful number, since it uses less digits than its factorization.
13130112012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1094176008 (or 1094176006 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 13130112012 its reverse (21021103131), we get a palindrome (34151215143).
The spelling of 13130112012 in words is "thirteen billion, one hundred thirty million, one hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •