Base | Representation |
---|---|
bin | 1101001100011001001001… |
… | …1100010110100110000100 |
3 | 1220100210222012200121110110 |
4 | 3103012102130112212010 |
5 | 3400133414213332313 |
6 | 50504120005153020 |
7 | 3025031054636565 |
oct | 323062234264604 |
9 | 56323865617413 |
10 | 14506561464708 |
11 | 469321a841695 |
12 | 17635760bb770 |
13 | 812c69593401 |
14 | 38219ac9616c |
15 | 1a2537ac3ec3 |
hex | d3192716984 |
14506561464708 has 24 divisors (see below), whose sum is σ = 34403539213120. Its totient is φ = 4756249660320.
The previous prime is 14506561464691. The next prime is 14506561464737. The reversal of 14506561464708 is 80746416560541.
It is a super-2 number, since 2×145065614647082 (a number of 27 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 9908852728 + ... + 9908854191.
Almost surely, 214506561464708 is an apocalyptic number.
It is an amenable number.
14506561464708 is an abundant number, since it is smaller than the sum of its proper divisors (19896977748412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14506561464708 is a wasteful number, since it uses less digits than its factorization.
14506561464708 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19817706987 (or 19817706985 counting only the distinct ones).
The product of its (nonzero) digits is 19353600, while the sum is 57.
The spelling of 14506561464708 in words is "fourteen trillion, five hundred six billion, five hundred sixty-one million, four hundred sixty-four thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •