Base | Representation |
---|---|
bin | 11010001010000111… |
… | …10111001100011100 |
3 | 1100020201101212101022 |
4 | 31011003313030130 |
5 | 212230121323200 |
6 | 10241305503312 |
7 | 1005004066004 |
oct | 150503671434 |
9 | 40221355338 |
10 | 14043542300 |
11 | 5a57239207 |
12 | 287b1a1b38 |
13 | 142a645b58 |
14 | 9731ad004 |
15 | 572d84885 |
hex | 3450f731c |
14043542300 has 18 divisors (see below), whose sum is σ = 30474487008. Its totient is φ = 5617416880.
The previous prime is 14043542299. The next prime is 14043542327. The reversal of 14043542300 is 324534041.
14043542300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 14043542300.
It is a congruent number.
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 5 ways as a sum of consecutive naturals, for example, 70217612 + ... + 70217811.
It is an arithmetic number, because the mean of its divisors is an integer number (1693027056).
Almost surely, 214043542300 is an apocalyptic number.
14043542300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14043542300 is an abundant number, since it is smaller than the sum of its proper divisors (16430944708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14043542300 is a wasteful number, since it uses less digits than its factorization.
14043542300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140435437 (or 140435430 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 26.
The spelling of 14043542300 in words is "fourteen billion, forty-three million, five hundred forty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •