Base | Representation |
---|---|
bin | 1111001001100000011111… |
… | …1011001111101011110110 |
3 | 2011222022002101212212111010 |
4 | 3302120013323033223312 |
5 | 4140343010113121032 |
6 | 55231400154453050 |
7 | 3336233415160143 |
oct | 362300773175366 |
9 | 64868071785433 |
10 | 16656016145142 |
11 | 534185a98a9a0 |
12 | 1a5006a134186 |
13 | 93a86a414c1a |
14 | 4182269053ca |
15 | 1dd3db864ccc |
hex | f2607ecfaf6 |
16656016145142 has 32 divisors (see below), whose sum is σ = 36700204806144. Its totient is φ = 4997304572000.
The previous prime is 16656016145141. The next prime is 16656016145179. The reversal of 16656016145142 is 24154161065661.
It is a super-2 number, since 2×166560161451422 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16656016145091 and 16656016145100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16656016145141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1249319478 + ... + 1249332809.
It is an arithmetic number, because the mean of its divisors is an integer number (1146881400192).
Almost surely, 216656016145142 is an apocalyptic number.
16656016145142 is an abundant number, since it is smaller than the sum of its proper divisors (20044188661002).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16656016145142 is a wasteful number, since it uses less digits than its factorization.
16656016145142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2498652404.
The product of its (nonzero) digits is 1036800, while the sum is 48.
The spelling of 16656016145142 in words is "sixteen trillion, six hundred fifty-six billion, sixteen million, one hundred forty-five thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •