Base | Representation |
---|---|
bin | 10100001101100… |
… | …10010010001100 |
3 | 102211001002020020 |
4 | 22012302102030 |
5 | 321401112423 |
6 | 24454022140 |
7 | 4126105515 |
oct | 1206622214 |
9 | 384032206 |
10 | 169550988 |
11 | 87786192 |
12 | 48947950 |
13 | 29185b39 |
14 | 18737a0c |
15 | ed424e3 |
hex | a1b248c |
169550988 has 12 divisors (see below), whose sum is σ = 395619000. Its totient is φ = 56516992.
The previous prime is 169550981. The next prime is 169550999. The reversal of 169550988 is 889055961.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×1695509882 = 57495075063552288, 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 169550988.
It is not an unprimeable number, because it can be changed into a prime (169550981) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7064613 + ... + 7064636.
It is an arithmetic number, because the mean of its divisors is an integer number (32968250).
Almost surely, 2169550988 is an apocalyptic number.
It is an amenable number.
169550988 is an abundant number, since it is smaller than the sum of its proper divisors (226068012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
169550988 is a wasteful number, since it uses less digits than its factorization.
169550988 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14129256 (or 14129254 counting only the distinct ones).
The product of its (nonzero) digits is 777600, while the sum is 51.
The square root of 169550988 is about 13021.1746013945. The cubic root of 169550988 is about 553.4776754452.
The spelling of 169550988 in words is "one hundred sixty-nine million, five hundred fifty thousand, nine hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •