Base | Representation |
---|---|
bin | 1001101101111001111… |
… | …0110010100000010100 |
3 | 120221220102122022002002 |
4 | 2123132132302200110 |
5 | 10213343442323023 |
6 | 204405232534432 |
7 | 15026651143442 |
oct | 2333636624024 |
9 | 527812568062 |
10 | 166941370388 |
11 | 64888062501 |
12 | 284303b1418 |
13 | 12986385590 |
14 | 811976bb92 |
15 | 4521074b28 |
hex | 26de7b2814 |
166941370388 has 12 divisors (see below), whose sum is σ = 314620275060. Its totient is φ = 77049863232.
The previous prime is 166941370369. The next prime is 166941370399. The reversal of 166941370388 is 883073149661.
166941370388 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 6990966544 + 159950403844 = 83612^2 + 399938^2 .
It is a super-2 number, since 2×1669413703882 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1605205433 + ... + 1605205536.
It is an arithmetic number, because the mean of its divisors is an integer number (26218356255).
Almost surely, 2166941370388 is an apocalyptic number.
It is an amenable number.
166941370388 is a deficient number, since it is larger than the sum of its proper divisors (147678904672).
166941370388 is a wasteful number, since it uses less digits than its factorization.
166941370388 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3210410986 (or 3210410984 counting only the distinct ones).
The product of its (nonzero) digits is 5225472, while the sum is 56.
The spelling of 166941370388 in words is "one hundred sixty-six billion, nine hundred forty-one million, three hundred seventy thousand, three hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •