Base | Representation |
---|---|
bin | 11010010001010010… |
… | …00101010101100000 |
3 | 1100101220110200212010 |
4 | 31020221011111200 |
5 | 212341012144300 |
6 | 10251253432520 |
7 | 1006333613211 |
oct | 151051052540 |
9 | 40356420763 |
10 | 14103631200 |
11 | 5a8814a95a |
12 | 289733b740 |
13 | 1439c24409 |
14 | 97b171408 |
15 | 5782a3a50 |
hex | 348a45560 |
14103631200 has 72 divisors (see below), whose sum is σ = 45907327368. Its totient is φ = 3760967680.
The previous prime is 14103631193. The next prime is 14103631229. The reversal of 14103631200 is 213630141.
It is a super-2 number, since 2×141036312002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2935857 + ... + 2940656.
It is an arithmetic number, because the mean of its divisors is an integer number (637601769).
Almost surely, 214103631200 is an apocalyptic number.
14103631200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14103631200 is an abundant number, since it is smaller than the sum of its proper divisors (31803696168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14103631200 is a wasteful number, since it uses less digits than its factorization.
14103631200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5876536 (or 5876523 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
The spelling of 14103631200 in words is "fourteen billion, one hundred three million, six hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •