Base | Representation |
---|---|
bin | 11010001010010110… |
… | …00001101101110000 |
3 | 1100020211221021122120 |
4 | 31011023001231300 |
5 | 212231111423100 |
6 | 10241414034240 |
7 | 1005026050344 |
oct | 150513015560 |
9 | 40224837576 |
10 | 14045420400 |
11 | 5a58301260 |
12 | 287b948980 |
13 | 142ab5295b |
14 | 97353b624 |
15 | 5731060a0 |
hex | 3452c1b70 |
14045420400 has 240 divisors, whose sum is σ = 51970387968. Its totient is φ = 3204608000.
The previous prime is 14045420393. The next prime is 14045420423. The reversal of 14045420400 is 402454041.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
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, 193105 + ... + 255695.
Almost surely, 214045420400 is an apocalyptic number.
14045420400 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 14045420400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25985193984).
14045420400 is an abundant number, since it is smaller than the sum of its proper divisors (37924967568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14045420400 is a wasteful number, since it uses less digits than its factorization.
14045420400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62640 (or 62629 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 24.
Adding to 14045420400 its reverse (402454041), we get a palindrome (14447874441).
The spelling of 14045420400 in words is "fourteen billion, forty-five million, four hundred twenty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •