Base | Representation |
---|---|
bin | 11001001001110010… |
… | …10001110101111000 |
3 | 1021212002222001010120 |
4 | 30210321101311320 |
5 | 210123444200302 |
6 | 10111551213240 |
7 | 655432141650 |
oct | 144471216570 |
9 | 37762861116 |
10 | 13503896952 |
11 | 57aa663717 |
12 | 274a517220 |
13 | 13728bc790 |
14 | 921657360 |
15 | 5407d99bc |
hex | 324e51d78 |
13503896952 has 64 divisors (see below), whose sum is σ = 41550458880. Its totient is φ = 3561466752.
The previous prime is 13503896947. The next prime is 13503897023. The reversal of 13503896952 is 25969830531.
13503896952 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 13503896895 and 13503896904.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 3089368 + ... + 3093735.
It is an arithmetic number, because the mean of its divisors is an integer number (649225920).
Almost surely, 213503896952 is an apocalyptic number.
13503896952 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13503896952 is an abundant number, since it is smaller than the sum of its proper divisors (28046561928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13503896952 is a wasteful number, since it uses less digits than its factorization.
13503896952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6183132 (or 6183128 counting only the distinct ones).
The product of its (nonzero) digits is 1749600, while the sum is 51.
The spelling of 13503896952 in words is "thirteen billion, five hundred three million, eight hundred ninety-six thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •