Base | Representation |
---|---|
bin | 1100110000110010110011… |
… | …0100000110001100100000 |
3 | 1211200111002210002001220002 |
4 | 3030030230310012030200 |
5 | 3314401333430313100 |
6 | 45502222234035132 |
7 | 2645544126034565 |
oct | 314145464061440 |
9 | 54614083061802 |
10 | 14032410010400 |
11 | 4520125699151 |
12 | 16a76a9878aa8 |
13 | 7aa3346cb1b2 |
14 | 36725a9c086c |
15 | 1950363c92d5 |
hex | cc32cd06320 |
14032410010400 has 72 divisors (see below), whose sum is σ = 34257143277504. Its totient is φ = 5612878419200.
The previous prime is 14032410010319. The next prime is 14032410010433. The reversal of 14032410010400 is 401001423041.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 92102285 + ... + 92254515.
It is an arithmetic number, because the mean of its divisors is an integer number (475793656632).
Almost surely, 214032410010400 is an apocalyptic number.
14032410010400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14032410010400 is an abundant number, since it is smaller than the sum of its proper divisors (20224733267104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14032410010400 is a wasteful number, since it uses less digits than its factorization.
14032410010400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267474 (or 267461 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 14032410010400 its reverse (401001423041), we get a palindrome (14433411433441).
The spelling of 14032410010400 in words is "fourteen trillion, thirty-two billion, four hundred ten million, ten thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •