Base | Representation |
---|---|
bin | 100101110000100010101100… |
… | …110010010110101111101101 |
3 | 210202222111221211211010200010 |
4 | 211300202230302112233231 |
5 | 133231241034142222221 |
6 | 1345104305250323433 |
7 | 46656456460332045 |
oct | 4560425462265755 |
9 | 722874854733603 |
10 | 166063514414061 |
11 | 48a05160690020 |
12 | 1676027ab89579 |
13 | 7187950926744 |
14 | 2d0173485c725 |
15 | 142ea5e365c76 |
hex | 9708acc96bed |
166063514414061 has 16 divisors (see below), whose sum is σ = 241548198612480. Its totient is φ = 100644025625520.
The previous prime is 166063514414041. The next prime is 166063514414071. The reversal of 166063514414061 is 160414415360661.
It is a happy number.
It is not a de Polignac number, because 166063514414061 - 230 = 166062440672237 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 166063514414061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166063514414041) 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, 6788721 + ... + 19447718.
It is an arithmetic number, because the mean of its divisors is an integer number (15096762413280).
Almost surely, 2166063514414061 is an apocalyptic number.
166063514414061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
166063514414061 is a deficient number, since it is larger than the sum of its proper divisors (75484684198419).
166063514414061 is a wasteful number, since it uses less digits than its factorization.
166063514414061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26428256.
The product of its (nonzero) digits is 1244160, while the sum is 48.
The spelling of 166063514414061 in words is "one hundred sixty-six trillion, sixty-three billion, five hundred fourteen million, four hundred fourteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •