Base | Representation |
---|---|
bin | 1001101010110111011… |
… | …0101100111011111101 |
3 | 120212210120112121101010 |
4 | 2122231312230323331 |
5 | 10210211120233303 |
6 | 204152251105433 |
7 | 15000513631314 |
oct | 2325566547375 |
9 | 525716477333 |
10 | 166125555453 |
11 | 644a95aa690 |
12 | 28243142279 |
13 | 12886356150 |
14 | 807d28727b |
15 | 44c4626c03 |
hex | 26addacefd |
166125555453 has 64 divisors (see below), whose sum is σ = 274058265600. Its totient is φ = 88001717760.
The previous prime is 166125555443. The next prime is 166125555461. The reversal of 166125555453 is 354555521661.
It is not a de Polignac number, because 166125555453 - 213 = 166125547261 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166125555443) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 22060993 + ... + 22068521.
It is an arithmetic number, because the mean of its divisors is an integer number (4282160400).
Almost surely, 2166125555453 is an apocalyptic number.
166125555453 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
166125555453 is a deficient number, since it is larger than the sum of its proper divisors (107932710147).
166125555453 is a wasteful number, since it uses less digits than its factorization.
166125555453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10282.
The product of its digits is 2700000, while the sum is 48.
The spelling of 166125555453 in words is "one hundred sixty-six billion, one hundred twenty-five million, five hundred fifty-five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •