Base | Representation |
---|---|
bin | 1110101101101001101… |
… | …01010011101000000001 |
3 | 1210022220022012021002012 |
4 | 13112310311103220001 |
5 | 31240324012442104 |
6 | 1024124424502305 |
7 | 51344606664635 |
oct | 7266465235001 |
9 | 1708808167065 |
10 | 505545046529 |
11 | 185444aa9a86 |
12 | 81b8a01a995 |
13 | 38898ba42b3 |
14 | 1a67b844dc5 |
15 | d23c84ed6e |
hex | 75b4d53a01 |
505545046529 has 2 divisors, whose sum is σ = 505545046530. Its totient is φ = 505545046528.
The previous prime is 505545046511. The next prime is 505545046547. The reversal of 505545046529 is 925640545505.
It is a balanced prime because it is at equal distance from previous prime (505545046511) and next prime (505545046547).
It can be written as a sum of positive squares in only one way, i.e., 376339306225 + 129205740304 = 613465^2 + 359452^2 .
It is a cyclic number.
It is not a de Polignac number, because 505545046529 - 212 = 505545042433 is a prime.
It is a super-3 number, since 3×5055450465293 (a number of 36 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (505545046429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 252772523264 + 252772523265.
It is an arithmetic number, because the mean of its divisors is an integer number (252772523265).
Almost surely, 2505545046529 is an apocalyptic number.
It is an amenable number.
505545046529 is a deficient number, since it is larger than the sum of its proper divisors (1).
505545046529 is an equidigital number, since it uses as much as digits as its factorization.
505545046529 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400000, while the sum is 50.
The spelling of 505545046529 in words is "five hundred five billion, five hundred forty-five million, forty-six thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •