Base | Representation |
---|---|
bin | 1001001001110111101000… |
… | …01010000111000010001100 |
3 | 2122021102212010102211110002 |
4 | 10210323310022013002030 |
5 | 10114303340114240022 |
6 | 110451423234503432 |
7 | 4145236631416220 |
oct | 444736412070214 |
9 | 78242763384402 |
10 | 20130313040012 |
11 | 6461243a0781a |
12 | 2311481134b78 |
13 | b30384ca0836 |
14 | 4d8453132780 |
15 | 24d980432092 |
hex | 124ef428708c |
20130313040012 has 48 divisors (see below), whose sum is σ = 41264790927360. Its totient is φ = 8412759919872.
The previous prime is 20130313039973. The next prime is 20130313040017. The reversal of 20130313040012 is 21004031303102.
It is a super-2 number, since 2×201303130400122 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20130313040017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13041437 + ... + 14503092.
It is an arithmetic number, because the mean of its divisors is an integer number (859683144320).
Almost surely, 220130313040012 is an apocalyptic number.
It is an amenable number.
20130313040012 is an abundant number, since it is smaller than the sum of its proper divisors (21134477887348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20130313040012 is a wasteful number, since it uses less digits than its factorization.
20130313040012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27545190 (or 27545188 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 20130313040012 its reverse (21004031303102), we get a palindrome (41134344343114).
The spelling of 20130313040012 in words is "twenty trillion, one hundred thirty billion, three hundred thirteen million, forty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •