Base | Representation |
---|---|
bin | 11011111101010… |
… | …010001100011001 |
3 | 1012200121012211022 |
4 | 123331102030121 |
5 | 1430034101022 |
6 | 114313212225 |
7 | 14423601053 |
oct | 3375221431 |
9 | 1180535738 |
10 | 469050137 |
11 | 220848346 |
12 | 111101075 |
13 | 7623997a |
14 | 4641a8d3 |
15 | 2b2a2c42 |
hex | 1bf52319 |
469050137 has 2 divisors, whose sum is σ = 469050138. Its totient is φ = 469050136.
The previous prime is 469050013. The next prime is 469050139. The reversal of 469050137 is 731050964.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 396647056 + 72403081 = 19916^2 + 8509^2 .
It is a cyclic number.
It is not a de Polignac number, because 469050137 - 216 = 468984601 is a prime.
Together with 469050139, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 469050097 and 469050106.
It is not a weakly prime, because it can be changed into another prime (469050139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 234525068 + 234525069.
It is an arithmetic number, because the mean of its divisors is an integer number (234525069).
Almost surely, 2469050137 is an apocalyptic number.
It is an amenable number.
469050137 is a deficient number, since it is larger than the sum of its proper divisors (1).
469050137 is an equidigital number, since it uses as much as digits as its factorization.
469050137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 22680, while the sum is 35.
The square root of 469050137 is about 21657.5653525506. The cubic root of 469050137 is about 776.9738858607.
The spelling of 469050137 in words is "four hundred sixty-nine million, fifty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •