Base | Representation |
---|---|
bin | 10100001010010… |
… | …10110010110101 |
3 | 102210020112202102 |
4 | 22011022302311 |
5 | 321244031333 |
6 | 24440551445 |
7 | 4122361622 |
oct | 1205126265 |
9 | 383215672 |
10 | 169127093 |
11 | 87516763 |
12 | 48782585 |
13 | 29067c05 |
14 | 18667349 |
15 | ecabae8 |
hex | a14acb5 |
169127093 has 4 divisors (see below), whose sum is σ = 169153740. Its totient is φ = 169100448.
The previous prime is 169127047. The next prime is 169127117. The reversal of 169127093 is 390721961.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 156325009 + 12802084 = 12503^2 + 3578^2 .
It is a cyclic number.
It is not a de Polignac number, because 169127093 - 26 = 169127029 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (169127003) 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 3 ways as a sum of consecutive naturals, for example, 2321 + ... + 18537.
It is an arithmetic number, because the mean of its divisors is an integer number (42288435).
Almost surely, 2169127093 is an apocalyptic number.
It is an amenable number.
169127093 is a deficient number, since it is larger than the sum of its proper divisors (26647).
169127093 is a wasteful number, since it uses less digits than its factorization.
169127093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26646.
The product of its (nonzero) digits is 20412, while the sum is 38.
The square root of 169127093 is about 13004.8872736368. The cubic root of 169127093 is about 553.0160400481.
The spelling of 169127093 in words is "one hundred sixty-nine million, one hundred twenty-seven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •