Base | Representation |
---|---|
bin | 1100111001011101100110… |
… | …1001000001001100001110 |
3 | 1212012201111212012211000021 |
4 | 3032113121221001030032 |
5 | 3324321340120442000 |
6 | 50054452243252354 |
7 | 2662365533643220 |
oct | 316273151011416 |
9 | 55181455184007 |
10 | 14181338452750 |
11 | 45782a9939167 |
12 | 171053167a0ba |
13 | 7bb3a9c77971 |
14 | 370547d18410 |
15 | 198d50d9011a |
hex | ce5d9a4130e |
14181338452750 has 64 divisors (see below), whose sum is σ = 30340930793472. Its totient is φ = 4862017716000.
The previous prime is 14181338452709. The next prime is 14181338452753. The reversal of 14181338452750 is 5725483318141.
It is a super-3 number, since 3×141813384527503 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14181338452753) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 63558885 + ... + 63781615.
It is an arithmetic number, because the mean of its divisors is an integer number (474077043648).
Almost surely, 214181338452750 is an apocalyptic number.
14181338452750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14181338452750 is an abundant number, since it is smaller than the sum of its proper divisors (16159592340722).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14181338452750 is a wasteful number, since it uses less digits than its factorization.
14181338452750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259138 (or 259128 counting only the distinct ones).
The product of its (nonzero) digits is 3225600, while the sum is 52.
The spelling of 14181338452750 in words is "fourteen trillion, one hundred eighty-one billion, three hundred thirty-eight million, four hundred fifty-two thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •