Base | Representation |
---|---|
bin | 11001010101011010… |
… | …11110110111010000 |
3 | 1022002220120011020202 |
4 | 30222231132313100 |
5 | 210323433432411 |
6 | 10125354354332 |
7 | 661025366144 |
oct | 145255366720 |
9 | 38086504222 |
10 | 13601467856 |
11 | 584a746129 |
12 | 277712b9a8 |
13 | 1389b92742 |
14 | 9305b5224 |
15 | 54915e83b |
hex | 32ab5edd0 |
13601467856 has 20 divisors (see below), whose sum is σ = 26442794532. Its totient is φ = 6777520896.
The previous prime is 13601467853. The next prime is 13601467871. The reversal of 13601467856 is 65876410631.
It can be written as a sum of positive squares in 2 ways, for example, as 5748672400 + 7852795456 = 75820^2 + 88616^2 .
It is a Smith number, since the sum of its digits (47) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 13601467856.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13601467853) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1445981 + ... + 1455356.
Almost surely, 213601467856 is an apocalyptic number.
13601467856 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
13601467856 is a deficient number, since it is larger than the sum of its proper divisors (12841326676).
13601467856 is a wasteful number, since it uses less digits than its factorization.
13601467856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2901638 (or 2901632 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 47.
The spelling of 13601467856 in words is "thirteen billion, six hundred one million, four hundred sixty-seven thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •