Base | Representation |
---|---|
bin | 1110101111010010001… |
… | …00011011100010111001 |
3 | 1210102011101020222012111 |
4 | 13113221010123202321 |
5 | 31244122341120421 |
6 | 1024351412412321 |
7 | 51405411046114 |
oct | 7275104334271 |
9 | 1712141228174 |
10 | 506421426361 |
11 | 185854769134 |
12 | 821936170a1 |
13 | 389a861a846 |
14 | 1a721db357b |
15 | d28e762ee1 |
hex | 75e911b8b9 |
506421426361 has 2 divisors, whose sum is σ = 506421426362. Its totient is φ = 506421426360.
The previous prime is 506421426311. The next prime is 506421426367. The reversal of 506421426361 is 163624124605.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 495045924025 + 11375502336 = 703595^2 + 106656^2 .
It is a cyclic number.
It is not a de Polignac number, because 506421426361 - 27 = 506421426233 is a prime.
It is a super-2 number, since 2×5064214263612 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (506421426367) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 253210713180 + 253210713181.
It is an arithmetic number, because the mean of its divisors is an integer number (253210713181).
Almost surely, 2506421426361 is an apocalyptic number.
It is an amenable number.
506421426361 is a deficient number, since it is larger than the sum of its proper divisors (1).
506421426361 is an equidigital number, since it uses as much as digits as its factorization.
506421426361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 207360, while the sum is 40.
The spelling of 506421426361 in words is "five hundred six billion, four hundred twenty-one million, four hundred twenty-six thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •