Base | Representation |
---|---|
bin | 1110101101010010100… |
… | …10110010111110111001 |
3 | 1210022101210220120022212 |
4 | 13112221102302332321 |
5 | 31234424432404203 |
6 | 1024053311224505 |
7 | 51340036312115 |
oct | 7265122627671 |
9 | 1708353816285 |
10 | 505351450553 |
11 | 1853557a0504 |
12 | 81b35218135 |
13 | 38867a4cb71 |
14 | 1a65dc4c745 |
15 | d22a85d1d8 |
hex | 75a94b2fb9 |
505351450553 has 2 divisors, whose sum is σ = 505351450554. Its totient is φ = 505351450552.
The previous prime is 505351450547. The next prime is 505351450561. The reversal of 505351450553 is 355054153505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 398221578304 + 107129872249 = 631048^2 + 327307^2 .
It is a cyclic number.
It is not a de Polignac number, because 505351450553 - 210 = 505351449529 is a prime.
It is a super-3 number, since 3×5053514505533 (a number of 36 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 505351450553.
It is not a weakly prime, because it can be changed into another prime (505351453553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 252675725276 + 252675725277.
It is an arithmetic number, because the mean of its divisors is an integer number (252675725277).
Almost surely, 2505351450553 is an apocalyptic number.
It is an amenable number.
505351450553 is a deficient number, since it is larger than the sum of its proper divisors (1).
505351450553 is an equidigital number, since it uses as much as digits as its factorization.
505351450553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 562500, while the sum is 41.
The spelling of 505351450553 in words is "five hundred five billion, three hundred fifty-one million, four hundred fifty thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •