Base | Representation |
---|---|
bin | 110011001100000101110111… |
… | …1000101001110111110100001 |
3 | 2012001020200111122102111202001 |
4 | 1212120023233011032332201 |
5 | 433004100312313314203 |
6 | 4233343442204324001 |
7 | 163561254200053444 |
oct | 14630135705167641 |
9 | 2161220448374661 |
10 | 450262612635553 |
11 | 120516335568783 |
12 | 425bbab1b43601 |
13 | 16431775095373 |
14 | 7d28b8079765b |
15 | 370c56cede91d |
hex | 19982ef14efa1 |
450262612635553 has 2 divisors, whose sum is σ = 450262612635554. Its totient is φ = 450262612635552.
The previous prime is 450262612635491. The next prime is 450262612635607. The reversal of 450262612635553 is 355536216262054.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 416917265776704 + 33345346858849 = 20418552^2 + 5774543^2 .
It is a cyclic number.
It is not a de Polignac number, because 450262612635553 - 245 = 415078240546721 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 450262612635494 and 450262612635503.
It is not a weakly prime, because it can be changed into another prime (450262612630553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 225131306317776 + 225131306317777.
It is an arithmetic number, because the mean of its divisors is an integer number (225131306317777).
Almost surely, 2450262612635553 is an apocalyptic number.
It is an amenable number.
450262612635553 is a deficient number, since it is larger than the sum of its proper divisors (1).
450262612635553 is an equidigital number, since it uses as much as digits as its factorization.
450262612635553 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 38880000, while the sum is 55.
The spelling of 450262612635553 in words is "four hundred fifty trillion, two hundred sixty-two billion, six hundred twelve million, six hundred thirty-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •