Base | Representation |
---|---|
bin | 110011010101111110000110… |
… | …0011111001100010011100101 |
3 | 2012020001110222022011120021001 |
4 | 1212223330030133030103211 |
5 | 433143321401301121112 |
6 | 4240303301523553301 |
7 | 164061330301164631 |
oct | 14653741437142345 |
9 | 2166043868146231 |
10 | 451620315645157 |
11 | 12099a11151205a |
12 | 4279b061b2b831 |
13 | 164cc7c7a89669 |
14 | 7d7477b70bdc1 |
15 | 3732a32b8cc57 |
hex | 19abf0c7cc4e5 |
451620315645157 has 2 divisors, whose sum is σ = 451620315645158. Its totient is φ = 451620315645156.
The previous prime is 451620315645127. The next prime is 451620315645193. The reversal of 451620315645157 is 751546513026154.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 444763045432836 + 6857270212321 = 21089406^2 + 2618639^2 .
It is a cyclic number.
It is not a de Polignac number, because 451620315645157 - 27 = 451620315645029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 451620315645098 and 451620315645107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (451620315645127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 225810157822578 + 225810157822579.
It is an arithmetic number, because the mean of its divisors is an integer number (225810157822579).
Almost surely, 2451620315645157 is an apocalyptic number.
It is an amenable number.
451620315645157 is a deficient number, since it is larger than the sum of its proper divisors (1).
451620315645157 is an equidigital number, since it uses as much as digits as its factorization.
451620315645157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120000, while the sum is 55.
The spelling of 451620315645157 in words is "four hundred fifty-one trillion, six hundred twenty billion, three hundred fifteen million, six hundred forty-five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •