Base | Representation |
---|---|
bin | 11000100110011010… |
… | …00110101111001100 |
3 | 1021002102111102101001 |
4 | 30103031012233030 |
5 | 204022004320320 |
6 | 10022310030044 |
7 | 645166351504 |
oct | 142315065714 |
9 | 37072442331 |
10 | 13207104460 |
11 | 5668080070 |
12 | 2687048324 |
13 | 1326275914 |
14 | 8d407aa04 |
15 | 52471120a |
hex | 313346bcc |
13207104460 has 48 divisors (see below), whose sum is σ = 30474017280. Its totient is φ = 4768021440.
The previous prime is 13207104451. The next prime is 13207104467. The reversal of 13207104460 is 6440170231.
13207104460 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (13207104467) 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, 185364 + ... + 246523.
It is an arithmetic number, because the mean of its divisors is an integer number (634875360).
Almost surely, 213207104460 is an apocalyptic number.
13207104460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13207104460 is an abundant number, since it is smaller than the sum of its proper divisors (17266912820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13207104460 is a wasteful number, since it uses less digits than its factorization.
13207104460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432046 (or 432044 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 28.
Adding to 13207104460 its reverse (6440170231), we get a palindrome (19647274691).
The spelling of 13207104460 in words is "thirteen billion, two hundred seven million, one hundred four thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •