Base | Representation |
---|---|
bin | 11001000011101010… |
… | …10011001110100101 |
3 | 1021201112021221111120 |
4 | 30201311103032211 |
5 | 210022321204110 |
6 | 10102514124153 |
7 | 654236360640 |
oct | 144165231645 |
9 | 37645257446 |
10 | 13452522405 |
11 | 5783664213 |
12 | 2735280659 |
13 | 136507283a |
14 | 9188c2a57 |
15 | 53b03c870 |
hex | 321d533a5 |
13452522405 has 64 divisors (see below), whose sum is σ = 25966694400. Its totient is φ = 5825742912.
The previous prime is 13452522403. The next prime is 13452522409. The reversal of 13452522405 is 50422525431.
It is a happy number.
13452522405 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13452522405 - 21 = 13452522403 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13452522403) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 710856 + ... + 729534.
It is an arithmetic number, because the mean of its divisors is an integer number (405729600).
Almost surely, 213452522405 is an apocalyptic number.
13452522405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13452522405 is a deficient number, since it is larger than the sum of its proper divisors (12514171995).
13452522405 is an equidigital number, since it uses as much as digits as its factorization.
13452522405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18751 (or 18713 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 33.
The spelling of 13452522405 in words is "thirteen billion, four hundred fifty-two million, five hundred twenty-two thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •