Base | Representation |
---|---|
bin | 1001101010100101100… |
… | …1011000100101011011 |
3 | 120212121100210122202002 |
4 | 2122221121120211123 |
5 | 10210032443323201 |
6 | 204141020031215 |
7 | 14665615115660 |
oct | 2325131304533 |
9 | 525540718662 |
10 | 166050761051 |
11 | 6447036452a |
12 | 2822209250b |
13 | 128739c92c6 |
14 | 8073377a67 |
15 | 44bcca076b |
hex | 26a965895b |
166050761051 has 8 divisors (see below), whose sum is σ = 189817185024. Its totient is φ = 142295558760.
The previous prime is 166050761029. The next prime is 166050761069. The reversal of 166050761051 is 150167050661.
166050761051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 166050761051 - 222 = 166046566747 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 166050760996 and 166050761014.
It is not an unprimeable number, because it can be changed into a prime (166050761011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2773685 + ... + 2832918.
It is an arithmetic number, because the mean of its divisors is an integer number (23727148128).
Almost surely, 2166050761051 is an apocalyptic number.
166050761051 is a deficient number, since it is larger than the sum of its proper divisors (23766423973).
166050761051 is an equidigital number, since it uses as much as digits as its factorization.
166050761051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5610841.
The product of its (nonzero) digits is 37800, while the sum is 38.
The spelling of 166050761051 in words is "one hundred sixty-six billion, fifty million, seven hundred sixty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •