Base | Representation |
---|---|
bin | 11010110111100010… |
… | …01110000100101000 |
3 | 1101020021022002221210 |
4 | 31123301032010220 |
5 | 214020134444430 |
6 | 10343155433120 |
7 | 1020311330640 |
oct | 153361160450 |
9 | 41207262853 |
10 | 14424531240 |
11 | 61322a98a9 |
12 | 29668b57a0 |
13 | 148b55c1b2 |
14 | 9aba25520 |
15 | 5965402b0 |
hex | 35bc4e128 |
14424531240 has 256 divisors, whose sum is σ = 50728550400. Its totient is φ = 3212798976.
The previous prime is 14424531227. The next prime is 14424531269. The reversal of 14424531240 is 4213542441.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 14424531198 and 14424531207.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10935301 + ... + 10936619.
It is an arithmetic number, because the mean of its divisors is an integer number (198158400).
Almost surely, 214424531240 is an apocalyptic number.
14424531240 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 14424531240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25364275200).
14424531240 is an abundant number, since it is smaller than the sum of its proper divisors (36304019160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14424531240 is a wasteful number, since it uses less digits than its factorization.
14424531240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1664 (or 1660 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 30.
The spelling of 14424531240 in words is "fourteen billion, four hundred twenty-four million, five hundred thirty-one thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •