Base | Representation |
---|---|
bin | 100101110111101010001110… |
… | …011010011100011101000101 |
3 | 210211201021110020011021102002 |
4 | 211313222032122130131011 |
5 | 133312244242030220003 |
6 | 1350121120014355045 |
7 | 50040013314511445 |
oct | 4567521632343505 |
9 | 724637406137362 |
10 | 166552631101253 |
11 | 49083635269521 |
12 | 1681b0231bba85 |
13 | 71c1acc083c47 |
14 | 2d1b2944a8125 |
15 | 143c6397a8a88 |
hex | 977a8e69c745 |
166552631101253 has 8 divisors (see below), whose sum is σ = 167672564016000. Its totient is φ = 165432726587088.
The previous prime is 166552631101249. The next prime is 166552631101291. The reversal of 166552631101253 is 352101136255661.
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 166552631101253 - 22 = 166552631101249 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 166552631101198 and 166552631101207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166552631101853) 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, 4734200 + ... + 18855182.
It is an arithmetic number, because the mean of its divisors is an integer number (20959070502000).
Almost surely, 2166552631101253 is an apocalyptic number.
It is an amenable number.
166552631101253 is a deficient number, since it is larger than the sum of its proper divisors (1119932914747).
166552631101253 is a wasteful number, since it uses less digits than its factorization.
166552631101253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14200291.
The product of its (nonzero) digits is 972000, while the sum is 47.
The spelling of 166552631101253 in words is "one hundred sixty-six trillion, five hundred fifty-two billion, six hundred thirty-one million, one hundred one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •