Base | Representation |
---|---|
bin | 1001101010101000000… |
… | …0011110110011100111 |
3 | 120212122002002100212101 |
4 | 2122222000132303213 |
5 | 10210043104311101 |
6 | 204142023432531 |
7 | 14666101203511 |
oct | 2325200366347 |
9 | 525562070771 |
10 | 166061010151 |
11 | 64476124863 |
12 | 282255b5747 |
13 | 12875b7736a |
14 | 8074884bb1 |
15 | 44bdb27401 |
hex | 26aa01ece7 |
166061010151 has 16 divisors (see below), whose sum is σ = 171720989440. Its totient is φ = 160485494400.
The previous prime is 166061010103. The next prime is 166061010179. The reversal of 166061010151 is 151010160661.
166061010151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 166061010151 - 27 = 166061010023 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166061010191) 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 15 ways as a sum of consecutive naturals, for example, 5303620 + ... + 5334838.
It is an arithmetic number, because the mean of its divisors is an integer number (10732561840).
Almost surely, 2166061010151 is an apocalyptic number.
166061010151 is a deficient number, since it is larger than the sum of its proper divisors (5659979289).
166061010151 is a wasteful number, since it uses less digits than its factorization.
166061010151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32566.
The product of its (nonzero) digits is 1080, while the sum is 28.
It can be divided in two parts, 1660610 and 10151, that added together give a palindrome (1670761).
The spelling of 166061010151 in words is "one hundred sixty-six billion, sixty-one million, ten thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •