Base | Representation |
---|---|
bin | 10100001010010… |
… | …01011010010001 |
3 | 102210020020222111 |
4 | 22011021122101 |
5 | 321243341200 |
6 | 24440505321 |
7 | 4122336244 |
oct | 1205113221 |
9 | 383206874 |
10 | 169121425 |
11 | 87512480 |
12 | 4877b241 |
13 | 29065465 |
14 | 1866525b |
15 | ecaa0ba |
hex | a149691 |
169121425 has 24 divisors (see below), whose sum is σ = 229360320. Its totient is φ = 122683200.
The previous prime is 169121411. The next prime is 169121429. The reversal of 169121425 is 524121961.
It is not a de Polignac number, because 169121425 - 27 = 169121297 is a prime.
It is not an unprimeable number, because it can be changed into a prime (169121429) 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 23 ways as a sum of consecutive naturals, for example, 201156 + ... + 201994.
It is an arithmetic number, because the mean of its divisors is an integer number (9556680).
Almost surely, 2169121425 is an apocalyptic number.
It is an amenable number.
169121425 is a deficient number, since it is larger than the sum of its proper divisors (60238895).
169121425 is a wasteful number, since it uses less digits than its factorization.
169121425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1593 (or 1588 counting only the distinct ones).
The product of its digits is 4320, while the sum is 31.
The square root of 169121425 is about 13004.6693537360. The cubic root of 169121425 is about 553.0098621892.
The spelling of 169121425 in words is "one hundred sixty-nine million, one hundred twenty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •