Base | Representation |
---|---|
bin | 1110100011100111010001… |
… | …01011011110010000001101 |
3 | 11012100010101221022020121001 |
4 | 13101303220223132100031 |
5 | 13143422440000000023 |
6 | 152025105130540301 |
7 | 6512434432446250 |
oct | 721635053362015 |
9 | 135303357266531 |
10 | 32010000000013 |
11 | a221401556962 |
12 | 370b904297691 |
13 | 14b26b7690a99 |
14 | 7c9413d9d097 |
15 | 3a79c0b646ad |
hex | 1d1ce8ade40d |
32010000000013 has 8 divisors (see below), whose sum is σ = 36585487789632. Its totient is φ = 27435169872096.
The previous prime is 32009999999981. The next prime is 32010000000019. The reversal of 32010000000013 is 31000000001023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 32010000000013 - 25 = 32009999999981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32010000000019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 164311120 + ... + 164505817.
It is an arithmetic number, because the mean of its divisors is an integer number (4573185973704).
Almost surely, 232010000000013 is an apocalyptic number.
It is an amenable number.
32010000000013 is a deficient number, since it is larger than the sum of its proper divisors (4575487789619).
32010000000013 is a wasteful number, since it uses less digits than its factorization.
32010000000013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328830851.
The product of its (nonzero) digits is 18, while the sum is 10.
Adding to 32010000000013 its reverse (31000000001023), we get a palindrome (63010000001036).
The spelling of 32010000000013 in words is "thirty-two trillion, ten billion, thirteen", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •