Base | Representation |
---|---|
bin | 1101001010000100100001… |
… | …1110101110011110001100 |
3 | 1220012222222211002021012000 |
4 | 3102201020132232132030 |
5 | 3344010212430222043 |
6 | 50433521120112300 |
7 | 3022116315645225 |
oct | 322411036563614 |
9 | 56188884067160 |
10 | 14466665867148 |
11 | 4678307811760 |
12 | 17578a1165690 |
13 | 80c27c036451 |
14 | 38029450424c |
15 | 1a14a03612d3 |
hex | d28487ae78c |
14466665867148 has 288 divisors, whose sum is σ = 43330384581120. Its totient is φ = 4138899431040.
The previous prime is 14466665867107. The next prime is 14466665867183. The reversal of 14466665867148 is 84176856666441.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 125600761 + ... + 125715887.
It is an arithmetic number, because the mean of its divisors is an integer number (150452724240).
Almost surely, 214466665867148 is an apocalyptic number.
14466665867148 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14466665867148, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21665192290560).
14466665867148 is an abundant number, since it is smaller than the sum of its proper divisors (28863718713972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14466665867148 is a wasteful number, since it uses less digits than its factorization.
14466665867148 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115482 (or 115455 counting only the distinct ones).
The product of its digits is 1114767360, while the sum is 72.
The spelling of 14466665867148 in words is "fourteen trillion, four hundred sixty-six billion, six hundred sixty-five million, eight hundred sixty-seven thousand, one hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •