Base | Representation |
---|---|
bin | 10100001001111… |
… | …11110011001001 |
3 | 102210011020222102 |
4 | 22010333303021 |
5 | 321241111212 |
6 | 24440003145 |
7 | 4122113414 |
oct | 1204776311 |
9 | 383136872 |
10 | 169082057 |
11 | 87495941 |
12 | 487604b5 |
13 | 29050571 |
14 | 18654b7b |
15 | ec9d5c2 |
hex | a13fcc9 |
169082057 has 4 divisors (see below), whose sum is σ = 171853956. Its totient is φ = 166310160.
The previous prime is 169082047. The next prime is 169082087. The reversal of 169082057 is 750280961.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 750280961 = 337 ⋅2226353.
It can be written as a sum of positive squares in 2 ways, for example, as 21799561 + 147282496 = 4669^2 + 12136^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-169082057 is a prime.
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 169082057.
It is not an unprimeable number, because it can be changed into a prime (169082047) 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, 1385858 + ... + 1385979.
It is an arithmetic number, because the mean of its divisors is an integer number (42963489).
Almost surely, 2169082057 is an apocalyptic number.
It is an amenable number.
169082057 is a deficient number, since it is larger than the sum of its proper divisors (2771899).
169082057 is an equidigital number, since it uses as much as digits as its factorization.
169082057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2771898.
The product of its (nonzero) digits is 30240, while the sum is 38.
The square root of 169082057 is about 13003.1556554553. The cubic root of 169082057 is about 552.9669490737.
The spelling of 169082057 in words is "one hundred sixty-nine million, eighty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •