Base | Representation |
---|---|
bin | 10100001011111… |
… | …10110101011000 |
3 | 102210122101011001 |
4 | 22011332311120 |
5 | 321322341443 |
6 | 24445314344 |
7 | 4124240230 |
oct | 1205766530 |
9 | 383571131 |
10 | 169340248 |
11 | 87651920 |
12 | 488659b4 |
13 | 29110c3c |
14 | 186c0cc0 |
15 | eceed4d |
hex | a17ed58 |
169340248 has 64 divisors (see below), whose sum is σ = 404352000. Its totient is φ = 64561920.
The previous prime is 169340239. The next prime is 169340257. The reversal of 169340248 is 842043961.
It is an interprime number because it is at equal distance from previous prime (169340239) and next prime (169340257).
It is a super-2 number, since 2×1693402482 = 57352239185403008, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26028 + ... + 31876.
It is an arithmetic number, because the mean of its divisors is an integer number (6318000).
Almost surely, 2169340248 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 169340248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (202176000).
169340248 is an abundant number, since it is smaller than the sum of its proper divisors (235011752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
169340248 is a wasteful number, since it uses less digits than its factorization.
169340248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5920 (or 5916 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 37.
The square root of 169340248 is about 13013.0798814116. The cubic root of 169340248 is about 553.2482690482.
The spelling of 169340248 in words is "one hundred sixty-nine million, three hundred forty thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •