Base | Representation |
---|---|
bin | 11001001111011101… |
… | …10011111011000000 |
3 | 1021222102111202010100 |
4 | 30213232303323000 |
5 | 210223140001413 |
6 | 10120411202400 |
7 | 656550501324 |
oct | 144756637300 |
9 | 37872452110 |
10 | 13551484608 |
11 | 5824506a62 |
12 | 2762446400 |
13 | 137c711b5c |
14 | 927ac3984 |
15 | 544a89a73 |
hex | 327bb3ec0 |
13551484608 has 168 divisors, whose sum is σ = 41349625200. Its totient is φ = 4231028736.
The previous prime is 13551484607. The next prime is 13551484621. The reversal of 13551484608 is 80648415531.
13551484608 is a `hidden beast` number, since 1 + 35 + 5 + 1 + 4 + 8 + 4 + 608 = 666.
It is not an unprimeable number, because it can be changed into a prime (13551484603) 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 23 ways as a sum of consecutive naturals, for example, 967060 + ... + 980972.
Almost surely, 213551484608 is an apocalyptic number.
13551484608 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13551484608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20674812600).
13551484608 is an abundant number, since it is smaller than the sum of its proper divisors (27798140592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13551484608 is a wasteful number, since it uses less digits than its factorization.
13551484608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14039 (or 14026 counting only the distinct ones).
The product of its (nonzero) digits is 460800, while the sum is 45.
The spelling of 13551484608 in words is "thirteen billion, five hundred fifty-one million, four hundred eighty-four thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •