Base | Representation |
---|---|
bin | 10111010101101001… |
… | …10000110011001001 |
3 | 1012100012201101022020 |
4 | 23222310300303021 |
5 | 201130041301010 |
6 | 5431145315053 |
7 | 622332064443 |
oct | 135264606311 |
9 | 35305641266 |
10 | 12529634505 |
11 | 534a719943 |
12 | 2518195a89 |
13 | 1248ac441b |
14 | 86c0c9493 |
15 | 4d4ede470 |
hex | 2ead30cc9 |
12529634505 has 8 divisors (see below), whose sum is σ = 20047415232. Its totient is φ = 6682471728.
The previous prime is 12529634483. The next prime is 12529634561. The reversal of 12529634505 is 50543692521.
It is a happy number.
12529634505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12529634505 - 29 = 12529633993 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 417654469 + ... + 417654498.
It is an arithmetic number, because the mean of its divisors is an integer number (2505926904).
Almost surely, 212529634505 is an apocalyptic number.
12529634505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12529634505 is a deficient number, since it is larger than the sum of its proper divisors (7517780727).
12529634505 is an equidigital number, since it uses as much as digits as its factorization.
12529634505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 835308975.
The product of its (nonzero) digits is 324000, while the sum is 42.
The spelling of 12529634505 in words is "twelve billion, five hundred twenty-nine million, six hundred thirty-four thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •