Base | Representation |
---|---|
bin | 100101111101100010010100… |
… | …100010100000010011000000 |
3 | 210220010212210210222122221010 |
4 | 211331202110202200103000 |
5 | 133340403312431201024 |
6 | 1351030423402400520 |
7 | 50111130511366446 |
oct | 4575422442402300 |
9 | 726125723878833 |
10 | 166956460803264 |
11 | 49219923639700 |
12 | 16885344b00140 |
13 | 7220c07c58b42 |
14 | 2d32a43130b96 |
15 | 1447dc24d8b29 |
hex | 97d8948a04c0 |
166956460803264 has 84 divisors (see below), whose sum is σ = 485547792668792. Its totient is φ = 50592866903040.
The previous prime is 166956460803263. The next prime is 166956460803281. The reversal of 166956460803264 is 462308064659661.
It is a super-2 number, since 2×1669564608032642 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a junction number, because it is equal to n+sod(n) for n = 166956460803195 and 166956460803204.
It is not an unprimeable number, because it can be changed into a prime (166956460803263) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3593220157 + ... + 3593266620.
Almost surely, 2166956460803264 is an apocalyptic number.
It is an amenable number.
166956460803264 is an abundant number, since it is smaller than the sum of its proper divisors (318591331865528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166956460803264 is a wasteful number, since it uses less digits than its factorization.
166956460803264 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7186486814 (or 7186486793 counting only the distinct ones).
The product of its (nonzero) digits is 268738560, while the sum is 66.
The spelling of 166956460803264 in words is "one hundred sixty-six trillion, nine hundred fifty-six billion, four hundred sixty million, eight hundred three thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •