Base | Representation |
---|---|
bin | 1100110010110000101101… |
… | …1100001110101000100110 |
3 | 1211210201100100102111200201 |
4 | 3030230023130032220212 |
5 | 3320430044210000000 |
6 | 45525532205501114 |
7 | 2651151535630021 |
oct | 314541334165046 |
9 | 54721310374621 |
10 | 14066209843750 |
11 | 453349a82a219 |
12 | 16b216127179a |
13 | 7b059009c89c |
14 | 368b459561b8 |
15 | 195d638d996a |
hex | ccb0b70ea26 |
14066209843750 has 64 divisors (see below), whose sum is σ = 27283535622720. Its totient is φ = 5432465500000.
The previous prime is 14066209843733. The next prime is 14066209843783. The reversal of 14066209843750 is 5734890266041.
It is a junction number, because it is equal to n+sod(n) for n = 14066209843691 and 14066209843700.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2979117 + ... + 6083383.
It is an arithmetic number, because the mean of its divisors is an integer number (426305244105).
It is a 2-persistent number, because it is pandigital, and so is 2⋅14066209843750 = 28132419687500, but 3⋅14066209843750 = 42198629531250 is not.
Almost surely, 214066209843750 is an apocalyptic number.
14066209843750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14066209843750 is a deficient number, since it is larger than the sum of its proper divisors (13217325778970).
14066209843750 is an frugal number, since it uses more digits than its factorization.
14066209843750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3104333 (or 3104303 counting only the distinct ones).
The product of its (nonzero) digits is 8709120, while the sum is 55.
The spelling of 14066209843750 in words is "fourteen trillion, sixty-six billion, two hundred nine million, eight hundred forty-three thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •