Base | Representation |
---|---|
bin | 11001000010111100… |
… | …10000110010110000 |
3 | 1021201002221010011100 |
4 | 30201132100302300 |
5 | 210014244424440 |
6 | 10102140444400 |
7 | 654134135460 |
oct | 144136206260 |
9 | 37632833140 |
10 | 13446483120 |
11 | 5780209874 |
12 | 2733249700 |
13 | 1363a399b5 |
14 | 917b8dba0 |
15 | 53a748230 |
hex | 321790cb0 |
13446483120 has 480 divisors, whose sum is σ = 53927976960. Its totient is φ = 2937876480.
The previous prime is 13446483119. The next prime is 13446483139. The reversal of 13446483120 is 2138464431.
13446483120 is a `hidden beast` number, since 1 + 3 + 4 + 4 + 648 + 3 + 1 + 2 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 13904877 + ... + 13905843.
It is an arithmetic number, because the mean of its divisors is an integer number (112349952).
Almost surely, 213446483120 is an apocalyptic number.
13446483120 is a gapful number since it is divisible by the number (10) 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 13446483120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26963988480).
13446483120 is an abundant number, since it is smaller than the sum of its proper divisors (40481493840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13446483120 is a wasteful number, since it uses less digits than its factorization.
13446483120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1113 (or 1104 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 36.
The spelling of 13446483120 in words is "thirteen billion, four hundred forty-six million, four hundred eighty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •