Base | Representation |
---|---|
bin | 1111001001110011010011… |
… | …1100010100110000110100 |
3 | 2011222210010100202212201221 |
4 | 3302130310330110300310 |
5 | 4140433330442320400 |
6 | 55233553242400124 |
7 | 3336502520320105 |
oct | 362346474246064 |
9 | 64883110685657 |
10 | 16661066370100 |
11 | 5343a11681729 |
12 | 1a51039500044 |
13 | 93b1937aa409 |
14 | 41858551c3ac |
15 | 1dd5d4ddcc1a |
hex | f2734f14c34 |
16661066370100 has 72 divisors (see below), whose sum is σ = 36177009523200. Its totient is φ = 6660281414400.
The previous prime is 16661066370037. The next prime is 16661066370121. The reversal of 16661066370100 is 107366016661.
16661066370100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×166610663701002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1624038771 + ... + 1624049029.
It is an arithmetic number, because the mean of its divisors is an integer number (502458465600).
Almost surely, 216661066370100 is an apocalyptic number.
16661066370100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16661066370100 is an abundant number, since it is smaller than the sum of its proper divisors (19515943153100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16661066370100 is a wasteful number, since it uses less digits than its factorization.
16661066370100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18793 (or 18786 counting only the distinct ones).
The product of its (nonzero) digits is 163296, while the sum is 43.
The spelling of 16661066370100 in words is "sixteen trillion, six hundred sixty-one billion, sixty-six million, three hundred seventy thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •