Base | Representation |
---|---|
bin | 11010011110000111… |
… | …10000101111000000 |
3 | 1100200102001020020000 |
4 | 31033003300233000 |
5 | 213101042204000 |
6 | 10310101120000 |
7 | 1012111645350 |
oct | 151703605700 |
9 | 40612036200 |
10 | 14211288000 |
11 | 60329a1018 |
12 | 29073b9000 |
13 | 1456319070 |
14 | 98b596b60 |
15 | 58296c000 |
hex | 34f0f0bc0 |
14211288000 has 1120 divisors, whose sum is σ = 64975118208. Its totient is φ = 2985984000.
The previous prime is 14211287999. The next prime is 14211288019. The reversal of 14211288000 is 88211241.
It is a tau number, because it is divible by the number of its divisors (1120).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 58967880 + ... + 58968120.
Almost surely, 214211288000 is an apocalyptic number.
14211288000 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 14211288000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32487559104).
14211288000 is an abundant number, since it is smaller than the sum of its proper divisors (50763830208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14211288000 is a wasteful number, since it uses less digits than its factorization.
14211288000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 300 (or 271 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 27.
Adding to 14211288000 its reverse (88211241), we get a palindrome (14299499241).
The spelling of 14211288000 in words is "fourteen billion, two hundred eleven million, two hundred eighty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •