Base | Representation |
---|---|
bin | 11011001001010… |
… | …110001110000001 |
3 | 1011201222111120001 |
4 | 123021112032001 |
5 | 1413042411022 |
6 | 113105320001 |
7 | 14200064143 |
oct | 3311261601 |
9 | 1151874501 |
10 | 455435137 |
11 | 214099183 |
12 | 108636001 |
13 | 73480861 |
14 | 446b4c93 |
15 | 29eb3b27 |
hex | 1b256381 |
455435137 has 2 divisors, whose sum is σ = 455435138. Its totient is φ = 455435136.
The previous prime is 455435131. The next prime is 455435173. The reversal of 455435137 is 731534554.
Together with next prime (455435173) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 353101681 + 102333456 = 18791^2 + 10116^2 .
It is a cyclic number.
It is not a de Polignac number, because 455435137 - 27 = 455435009 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 455435096 and 455435105.
It is not a weakly prime, because it can be changed into another prime (455435131) 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 as a sum of consecutive naturals, namely, 227717568 + 227717569.
It is an arithmetic number, because the mean of its divisors is an integer number (227717569).
Almost surely, 2455435137 is an apocalyptic number.
It is an amenable number.
455435137 is a deficient number, since it is larger than the sum of its proper divisors (1).
455435137 is an equidigital number, since it uses as much as digits as its factorization.
455435137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 126000, while the sum is 37.
The square root of 455435137 is about 21340.9263388448. The cubic root of 455435137 is about 769.3822768210.
The spelling of 455435137 in words is "four hundred fifty-five million, four hundred thirty-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •