Base | Representation |
---|---|
bin | 11010111001011010… |
… | …01001001110000000 |
3 | 1101021100212012022201 |
4 | 31130231021032000 |
5 | 214033200140000 |
6 | 10344520242544 |
7 | 1020562005034 |
oct | 153455111600 |
9 | 41240765281 |
10 | 14440240000 |
11 | 614015904a |
12 | 2970010454 |
13 | 149189c314 |
14 | 9adb541c4 |
15 | 597ae496a |
hex | 35cb49380 |
14440240000 has 80 divisors (see below), whose sum is σ = 35948274120. Its totient is φ = 5776064000.
The previous prime is 14440239997. The next prime is 14440240013. The reversal of 14440240000 is 4204441.
It is a tau number, because it is divible by the number of its divisors (80).
It is a self number, because there is not a number n which added to its sum of digits gives 14440240000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 10252 + ... + 170251.
Almost surely, 214440240000 is an apocalyptic number.
14440240000 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 14440240000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17974137060).
14440240000 is an abundant number, since it is smaller than the sum of its proper divisors (21508034120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14440240000 is an frugal number, since it uses more digits than its factorization.
14440240000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180537 (or 180510 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 19.
Adding to 14440240000 its reverse (4204441), we get a palindrome (14444444441).
The spelling of 14440240000 in words is "fourteen billion, four hundred forty million, two hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •