Base | Representation |
---|---|
bin | 1001101010011100011… |
… | …1100011100100011101 |
3 | 120212111200212110202010 |
4 | 2122213013203210131 |
5 | 10204443202024041 |
6 | 204133132421433 |
7 | 14664642150666 |
oct | 2324707434435 |
9 | 525450773663 |
10 | 166012533021 |
11 | 64450824215 |
12 | 28211317879 |
13 | 12868b0317a |
14 | 806c26636d |
15 | 44b974da16 |
hex | 26a71e391d |
166012533021 has 8 divisors (see below), whose sum is σ = 221863618944. Its totient is φ = 110418234560.
The previous prime is 166012533019. The next prime is 166012533121. The reversal of 166012533021 is 120335210661.
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 166012533021 - 21 = 166012533019 is a prime.
It is a super-2 number, since 2×1660125330212 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 166012533021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166012533121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64195356 + ... + 64197941.
It is an arithmetic number, because the mean of its divisors is an integer number (27732952368).
Almost surely, 2166012533021 is an apocalyptic number.
It is an amenable number.
166012533021 is a deficient number, since it is larger than the sum of its proper divisors (55851085923).
166012533021 is a wasteful number, since it uses less digits than its factorization.
166012533021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128393731.
The product of its (nonzero) digits is 6480, while the sum is 30.
Adding to 166012533021 its reverse (120335210661), we get a palindrome (286347743682).
The spelling of 166012533021 in words is "one hundred sixty-six billion, twelve million, five hundred thirty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •