Base | Representation |
---|---|
bin | 1100110000001100100011… |
… | …0011001010110111100000 |
3 | 1211122111121012012202011010 |
4 | 3030003020303022313200 |
5 | 3314214321340024300 |
6 | 45453403321220520 |
7 | 2645031516241446 |
oct | 314031063126740 |
9 | 54574535182133 |
10 | 14022142111200 |
11 | 4516836735543 |
12 | 16a5703031740 |
13 | 7a93893721b2 |
14 | 366965042b96 |
15 | 194b34c4da50 |
hex | cc0c8ccade0 |
14022142111200 has 72 divisors (see below), whose sum is σ = 45642072579768. Its totient is φ = 3739237895680.
The previous prime is 14022142111189. The next prime is 14022142111213. The reversal of 14022142111200 is 211124122041.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2921277207 + ... + 2921282006.
It is an arithmetic number, because the mean of its divisors is an integer number (633917674719).
Almost surely, 214022142111200 is an apocalyptic number.
14022142111200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14022142111200 is an abundant number, since it is smaller than the sum of its proper divisors (31619930468568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14022142111200 is a wasteful number, since it uses less digits than its factorization.
14022142111200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5842559236 (or 5842559223 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 14022142111200 its reverse (211124122041), we get a palindrome (14233266233241).
The spelling of 14022142111200 in words is "fourteen trillion, twenty-two billion, one hundred forty-two million, one hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •