Base | Representation |
---|---|
bin | 1001101100101101011… |
… | …0010111111100100001 |
3 | 120221002001200011211121 |
4 | 2123023112113330201 |
5 | 10212214310203340 |
6 | 204313325212241 |
7 | 15016003003123 |
oct | 2331326277441 |
9 | 527061604747 |
10 | 166620397345 |
11 | 64732963726 |
12 | 28360a01081 |
13 | 12934a234bc |
14 | 80c8c99213 |
15 | 4502cc194a |
hex | 26cb597f21 |
166620397345 has 4 divisors (see below), whose sum is σ = 199944476820. Its totient is φ = 133296317872.
The previous prime is 166620397313. The next prime is 166620397373. The reversal of 166620397345 is 543793026661.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 17352529441 + 149267867904 = 131729^2 + 386352^2 .
It is a cyclic number.
It is not a de Polignac number, because 166620397345 - 25 = 166620397313 is a prime.
It is a super-2 number, since 2×1666203973452 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 166620397292 and 166620397301.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16662039730 + ... + 16662039739.
It is an arithmetic number, because the mean of its divisors is an integer number (49986119205).
Almost surely, 2166620397345 is an apocalyptic number.
It is an amenable number.
166620397345 is a deficient number, since it is larger than the sum of its proper divisors (33324079475).
166620397345 is an equidigital number, since it uses as much as digits as its factorization.
166620397345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33324079474.
The product of its (nonzero) digits is 4898880, while the sum is 52.
The spelling of 166620397345 in words is "one hundred sixty-six billion, six hundred twenty million, three hundred ninety-seven thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •