Base | Representation |
---|---|
bin | 11001001001111111… |
… | …00011100100011000 |
3 | 1021212020001122021222 |
4 | 30210333203210120 |
5 | 210124404324144 |
6 | 10112050351212 |
7 | 655452134153 |
oct | 144477434430 |
9 | 37766048258 |
10 | 13505542424 |
11 | 5800587a10 |
12 | 274ab8b508 |
13 | 137304772a |
14 | 921964c9a |
15 | 540a122ee |
hex | 324fe3918 |
13505542424 has 64 divisors (see below), whose sum is σ = 29283755040. Its totient is φ = 5771100160.
The previous prime is 13505542423. The next prime is 13505542439. The reversal of 13505542424 is 42424550531.
13505542424 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13505542423) 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 15 ways as a sum of consecutive naturals, for example, 1420952 + ... + 1430424.
Almost surely, 213505542424 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13505542424, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14641877520).
13505542424 is an abundant number, since it is smaller than the sum of its proper divisors (15778212616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13505542424 is a wasteful number, since it uses less digits than its factorization.
13505542424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10460 (or 10456 counting only the distinct ones).
The product of its (nonzero) digits is 96000, while the sum is 35.
The spelling of 13505542424 in words is "thirteen billion, five hundred five million, five hundred forty-two thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •