Base | Representation |
---|---|
bin | 10011110100001… |
… | …10101000100101 |
3 | 102120210011211220 |
4 | 21322012220211 |
5 | 320023221334 |
6 | 24254450553 |
7 | 4055621163 |
oct | 1172065045 |
9 | 376704756 |
10 | 166226469 |
11 | 85915452 |
12 | 47803a59 |
13 | 28590876 |
14 | 18110233 |
15 | e8d7449 |
hex | 9e86a25 |
166226469 has 8 divisors (see below), whose sum is σ = 221711040. Its totient is φ = 110779776.
The previous prime is 166226453. The next prime is 166226471. The reversal of 166226469 is 964622661.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 166226469 - 24 = 166226453 is a prime.
It is a super-2 number, since 2×1662264692 = 55262477992415922, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 166226469.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166226569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3192 + ... + 18510.
It is an arithmetic number, because the mean of its divisors is an integer number (27713880).
Almost surely, 2166226469 is an apocalyptic number.
It is an amenable number.
166226469 is a deficient number, since it is larger than the sum of its proper divisors (55484571).
166226469 is a wasteful number, since it uses less digits than its factorization.
166226469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18939.
The product of its digits is 186624, while the sum is 42.
The square root of 166226469 is about 12892.8844328955. The cubic root of 166226469 is about 549.8362807469.
The spelling of 166226469 in words is "one hundred sixty-six million, two hundred twenty-six thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •