Base | Representation |
---|---|
bin | 11101010010110010000… |
… | …011101101000110010001 |
3 | 21010102222122212120001220 |
4 | 131102302003231012101 |
5 | 230440142143311004 |
6 | 4140435114115253 |
7 | 265302544522500 |
oct | 35226203550621 |
9 | 7112878776056 |
10 | 2013032010129 |
11 | 7067a40a9998 |
12 | 28618041bb29 |
13 | 117a9c462c7a |
14 | 6d60758c837 |
15 | 3756c153dd9 |
hex | 1d4b20ed191 |
2013032010129 has 48 divisors (see below), whose sum is σ = 3241838027520. Its totient is φ = 1106539418880.
The previous prime is 2013032010061. The next prime is 2013032010193. The reversal of 2013032010129 is 9210102303102.
It is not a de Polignac number, because 2013032010129 - 29 = 2013032009617 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2013032010099 and 2013032010108.
It is not an unprimeable number, because it can be changed into a prime (2013032050129) 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 47 ways as a sum of consecutive naturals, for example, 284037 + ... + 2026509.
It is an arithmetic number, because the mean of its divisors is an integer number (67538292240).
Almost surely, 22013032010129 is an apocalyptic number.
2013032010129 is a gapful number since it is divisible by the number (29) formed by its first and last digit.
It is an amenable number.
2013032010129 is a deficient number, since it is larger than the sum of its proper divisors (1228806017391).
2013032010129 is a wasteful number, since it uses less digits than its factorization.
2013032010129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1742790 (or 1742783 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
The spelling of 2013032010129 in words is "two trillion, thirteen billion, thirty-two million, ten thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •