Base | Representation |
---|---|
bin | 1101000111000001000… |
… | …00011110110101000101 |
3 | 1121001200011100221111211 |
4 | 12203200200132311011 |
5 | 24340001430210203 |
6 | 542533013131421 |
7 | 44354255053234 |
oct | 6434040366505 |
9 | 1531604327454 |
10 | 450443210053 |
11 | 1640394a3751 |
12 | 73370629b71 |
13 | 3362716b325 |
14 | 17b31704b1b |
15 | bab5139c6d |
hex | 68e081ed45 |
450443210053 has 2 divisors, whose sum is σ = 450443210054. Its totient is φ = 450443210052.
The previous prime is 450443210051. The next prime is 450443210069. The reversal of 450443210053 is 350012344054.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 291619440324 + 158823769729 = 540018^2 + 398527^2 .
It is a cyclic number.
It is not a de Polignac number, because 450443210053 - 21 = 450443210051 is a prime.
Together with 450443210051, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 450443209997 and 450443210024.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (450443210051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 225221605026 + 225221605027.
It is an arithmetic number, because the mean of its divisors is an integer number (225221605027).
Almost surely, 2450443210053 is an apocalyptic number.
It is an amenable number.
450443210053 is a deficient number, since it is larger than the sum of its proper divisors (1).
450443210053 is an equidigital number, since it uses as much as digits as its factorization.
450443210053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800, while the sum is 31.
The spelling of 450443210053 in words is "four hundred fifty billion, four hundred forty-three million, two hundred ten thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •