Base | Representation |
---|---|
bin | 1110110010110100100… |
… | …00011011100010000001 |
3 | 1210121001201111200210201 |
4 | 13121122100123202001 |
5 | 31312020010204231 |
6 | 1025304050125201 |
7 | 51503440042003 |
oct | 7313220334201 |
9 | 1717051450721 |
10 | 508320397441 |
11 | 18663968121a |
12 | 82623580801 |
13 | 38c1bb80c7c |
14 | 1a862290373 |
15 | d35131b161 |
hex | 765a41b881 |
508320397441 has 2 divisors, whose sum is σ = 508320397442. Its totient is φ = 508320397440.
The previous prime is 508320397439. The next prime is 508320397511. The reversal of 508320397441 is 144793023805.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 368575266816 + 139745130625 = 607104^2 + 373825^2 .
It is a cyclic number.
It is not a de Polignac number, because 508320397441 - 21 = 508320397439 is a prime.
Together with 508320397439, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 508320397391 and 508320397400.
It is not a weakly prime, because it can be changed into another prime (508320397411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 254160198720 + 254160198721.
It is an arithmetic number, because the mean of its divisors is an integer number (254160198721).
Almost surely, 2508320397441 is an apocalyptic number.
It is an amenable number.
508320397441 is a deficient number, since it is larger than the sum of its proper divisors (1).
508320397441 is an equidigital number, since it uses as much as digits as its factorization.
508320397441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 725760, while the sum is 46.
The spelling of 508320397441 in words is "five hundred eight billion, three hundred twenty million, three hundred ninety-seven thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •