Base | Representation |
---|---|
bin | 1001101010100000110… |
… | …0000100100101100101 |
3 | 120212112221122222122112 |
4 | 2122220030010211211 |
5 | 10210012301302203 |
6 | 204135013410405 |
7 | 14665250625344 |
oct | 2325014044545 |
9 | 525487588575 |
10 | 166030494053 |
11 | 6445a981646 |
12 | 28217339a05 |
13 | 1286c7514b8 |
14 | 80707bdb5b |
15 | 44bb0ea6d8 |
hex | 26a8304965 |
166030494053 has 4 divisors (see below), whose sum is σ = 166617174528. Its totient is φ = 165443813580.
The previous prime is 166030494029. The next prime is 166030494139. The reversal of 166030494053 is 350494030661.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 166030494053 - 212 = 166030489957 is a prime.
It is a super-2 number, since 2×1660304940532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 166030494053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166030494023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 293339813 + ... + 293340378.
It is an arithmetic number, because the mean of its divisors is an integer number (41654293632).
Almost surely, 2166030494053 is an apocalyptic number.
It is an amenable number.
166030494053 is a deficient number, since it is larger than the sum of its proper divisors (586680475).
166030494053 is an equidigital number, since it uses as much as digits as its factorization.
166030494053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 586680474.
The product of its (nonzero) digits is 233280, while the sum is 41.
The spelling of 166030494053 in words is "one hundred sixty-six billion, thirty million, four hundred ninety-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •