Base | Representation |
---|---|
bin | 100101110101101011000000… |
… | …011100000011011010111010 |
3 | 210211020012212100210000020212 |
4 | 211311223000130003122322 |
5 | 133303030013021232310 |
6 | 1345534245221351122 |
7 | 50024106252460133 |
oct | 4565530034033272 |
9 | 724205770700225 |
10 | 166416031430330 |
11 | 49030708315a00 |
12 | 167b86602684a2 |
13 | 71b1c6cb017b6 |
14 | 2d148166d0c8a |
15 | 1438ce2357205 |
hex | 975ac07036ba |
166416031430330 has 96 divisors (see below), whose sum is σ = 331480407080592. Its totient is φ = 60106802088960.
The previous prime is 166416031430323. The next prime is 166416031430333. The reversal of 166416031430330 is 33034130614661.
It can be written as a sum of positive squares in 8 ways, for example, as 108158731203721 + 58257300226609 = 10399939^2 + 7632647^2 .
It is a super-3 number, since 3×1664160314303303 (a number of 44 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (166416031430333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 215853092 + ... + 216622688.
Almost surely, 2166416031430330 is an apocalyptic number.
166416031430330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
166416031430330 is a deficient number, since it is larger than the sum of its proper divisors (165064375650262).
166416031430330 is a wasteful number, since it uses less digits than its factorization.
166416031430330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 770832 (or 770821 counting only the distinct ones).
The product of its (nonzero) digits is 279936, while the sum is 41.
The spelling of 166416031430330 in words is "one hundred sixty-six trillion, four hundred sixteen billion, thirty-one million, four hundred thirty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •