Base | Representation |
---|---|
bin | 11000001110010001… |
… | …01110101111110101 |
3 | 1020120022111201001002 |
4 | 30013020232233311 |
5 | 203113141143104 |
6 | 5550234213045 |
7 | 640160353115 |
oct | 140710565765 |
9 | 36508451032 |
10 | 13004631029 |
11 | 5573858855 |
12 | 262b284185 |
13 | 12c3333860 |
14 | 8b5213045 |
15 | 511a6901e |
hex | 30722ebf5 |
13004631029 has 16 divisors (see below), whose sum is σ = 14097605760. Its totient is φ = 11925144000.
The previous prime is 13004630999. The next prime is 13004631061. The reversal of 13004631029 is 92013640031.
It is a cyclic number.
It is not a de Polignac number, because 13004631029 - 220 = 13003582453 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13004630992 and 13004631010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13004631229) 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, 1290392 + ... + 1300430.
It is an arithmetic number, because the mean of its divisors is an integer number (881100360).
Almost surely, 213004631029 is an apocalyptic number.
It is an amenable number.
13004631029 is a deficient number, since it is larger than the sum of its proper divisors (1092974731).
13004631029 is a wasteful number, since it uses less digits than its factorization.
13004631029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10700.
The product of its (nonzero) digits is 3888, while the sum is 29.
The spelling of 13004631029 in words is "thirteen billion, four million, six hundred thirty-one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •