Base | Representation |
---|---|
bin | 11001010100110100… |
… | …11111100100101101 |
3 | 1022002120012020221210 |
4 | 30222122133210231 |
5 | 210321200140104 |
6 | 10125055545033 |
7 | 660635154423 |
oct | 145232374455 |
9 | 38076166853 |
10 | 13596490029 |
11 | 5847956221 |
12 | 277552b179 |
13 | 1388b3ba95 |
14 | 92da7b113 |
15 | 5489c9989 |
hex | 32a69f92d |
13596490029 has 8 divisors (see below), whose sum is σ = 18399230560. Its totient is φ = 8929038096.
The previous prime is 13596490021. The next prime is 13596490031. The reversal of 13596490029 is 92009469531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13596490029 - 23 = 13596490021 is a prime.
It is a super-2 number, since 2×135964900292 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13596490029.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13596490021) 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 7 ways as a sum of consecutive naturals, for example, 33821914 + ... + 33822315.
It is an arithmetic number, because the mean of its divisors is an integer number (2299903820).
Almost surely, 213596490029 is an apocalyptic number.
It is an amenable number.
13596490029 is a deficient number, since it is larger than the sum of its proper divisors (4802740531).
13596490029 is an equidigital number, since it uses as much as digits as its factorization.
13596490029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67644299.
The product of its (nonzero) digits is 524880, while the sum is 48.
The spelling of 13596490029 in words is "thirteen billion, five hundred ninety-six million, four hundred ninety thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •