Base | Representation |
---|---|
bin | 11001000011111010… |
… | …00001011011111000 |
3 | 1021201200002210021201 |
4 | 30201331001123320 |
5 | 210023330443210 |
6 | 10103025343544 |
7 | 654262521421 |
oct | 144175013370 |
9 | 37650083251 |
10 | 13454546680 |
11 | 5784817073 |
12 | 2735a97bb4 |
13 | 1365601033 |
14 | 918c8c648 |
15 | 53b2dc53a |
hex | 321f416f8 |
13454546680 has 16 divisors (see below), whose sum is σ = 30272730120. Its totient is φ = 5381818656.
The previous prime is 13454546671. The next prime is 13454546683. The reversal of 13454546680 is 8664545431.
13454546680 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 13454546680.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13454546683) 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 3 ways as a sum of consecutive naturals, for example, 168181794 + ... + 168181873.
Almost surely, 213454546680 is an apocalyptic number.
13454546680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13454546680 is an abundant number, since it is smaller than the sum of its proper divisors (16818183440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13454546680 is a wasteful number, since it uses less digits than its factorization.
13454546680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336363678 (or 336363674 counting only the distinct ones).
The product of its (nonzero) digits is 1382400, while the sum is 46.
The spelling of 13454546680 in words is "thirteen billion, four hundred fifty-four million, five hundred forty-six thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •