Base | Representation |
---|---|
bin | 100101110011011011101010… |
… | …010111101010101110110101 |
3 | 210210200111120201221011022120 |
4 | 211303123222113222232311 |
5 | 133243014303210213140 |
6 | 1345335432305550153 |
7 | 50010020141660526 |
oct | 4563335227525665 |
9 | 723614521834276 |
10 | 166262116101045 |
11 | 48a81405104a28 |
12 | 16792866345359 |
13 | 71a05b1337c63 |
14 | 2d0b1b4d4a84d |
15 | 1434cd4b7a1d0 |
hex | 9736ea5eabb5 |
166262116101045 has 16 divisors (see below), whose sum is σ = 267651406537152. Its totient is φ = 88129121662080.
The previous prime is 166262116101023. The next prime is 166262116101143. The reversal of 166262116101045 is 540101611262661.
It is not a de Polignac number, because 166262116101045 - 210 = 166262116100021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 166262116100988 and 166262116101006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34000430296 + ... + 34000435185.
It is an arithmetic number, because the mean of its divisors is an integer number (16728212908572).
Almost surely, 2166262116101045 is an apocalyptic number.
166262116101045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
166262116101045 is a deficient number, since it is larger than the sum of its proper divisors (101389290436107).
166262116101045 is a wasteful number, since it uses less digits than its factorization.
166262116101045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68000865652.
The product of its (nonzero) digits is 103680, while the sum is 42.
The spelling of 166262116101045 in words is "one hundred sixty-six trillion, two hundred sixty-two billion, one hundred sixteen million, one hundred one thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •