Base | Representation |
---|---|
bin | 110011001101111010111101… |
… | …0001010101100000001111101 |
3 | 2012002010201112001002111112112 |
4 | 1212123311322022230001331 |
5 | 433022210240333421334 |
6 | 4234055144353543405 |
7 | 163615365146105336 |
oct | 14633657212540175 |
9 | 2162121461074475 |
10 | 450514054201469 |
11 | 120602a347a0815 |
12 | 42640785274b65 |
13 | 1644c3a69c722b |
14 | 7d36dd481b28d |
15 | 3713d8765e4ce |
hex | 199bd7a2ac07d |
450514054201469 has 2 divisors, whose sum is σ = 450514054201470. Its totient is φ = 450514054201468.
The previous prime is 450514054201459. The next prime is 450514054201499. The reversal of 450514054201469 is 964102450415054.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 358570694737369 + 91943359464100 = 18935963^2 + 9588710^2 .
It is a cyclic number.
It is not a de Polignac number, because 450514054201469 - 216 = 450514054135933 is a prime.
It is a super-2 number, since 2×4505140542014692 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (450514054201429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 225257027100734 + 225257027100735.
It is an arithmetic number, because the mean of its divisors is an integer number (225257027100735).
Almost surely, 2450514054201469 is an apocalyptic number.
It is an amenable number.
450514054201469 is a deficient number, since it is larger than the sum of its proper divisors (1).
450514054201469 is an equidigital number, since it uses as much as digits as its factorization.
450514054201469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456000, while the sum is 50.
The spelling of 450514054201469 in words is "four hundred fifty trillion, five hundred fourteen billion, fifty-four million, two hundred one thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •