Base | Representation |
---|---|
bin | 11011000001001100… |
… | …10011000000000000 |
3 | 1101102220202111011210 |
4 | 31200212103000000 |
5 | 214201410211140 |
6 | 10355212210120 |
7 | 1022314113444 |
oct | 154046230000 |
9 | 41386674153 |
10 | 14505553920 |
11 | 61740093a0 |
12 | 2989a69940 |
13 | 14a2289c00 |
14 | 9b86b6824 |
15 | 59d6e6d80 |
hex | 360993000 |
14505553920 has 624 divisors, whose sum is σ = 55257403392. Its totient is φ = 3220439040.
The previous prime is 14505553919. The next prime is 14505553961. The reversal of 14505553920 is 2935550541.
It is a tau number, because it is divible by the number of its divisors (624).
It is a super-2 number, since 2×145055539202 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 114216897 + ... + 114217023.
Almost surely, 214505553920 is an apocalyptic number.
14505553920 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 14505553920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27628701696).
14505553920 is an abundant number, since it is smaller than the sum of its proper divisors (40751849472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14505553920 is a wasteful number, since it uses less digits than its factorization.
14505553920 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 196 (or 161 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 39.
The spelling of 14505553920 in words is "fourteen billion, five hundred five million, five hundred fifty-three thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •