Base | Representation |
---|---|
bin | 1110100110111100001… |
… | …11111111100001010001 |
3 | 1202222121021000101110012 |
4 | 13103132013333201101 |
5 | 31210434331442343 |
6 | 1022331145044305 |
7 | 51156416526131 |
oct | 7233607774121 |
9 | 1688537011405 |
10 | 501942843473 |
11 | 183966716565 |
12 | 81343786695 |
13 | 384438024b6 |
14 | 1a419280ac1 |
15 | d0cb4a5718 |
hex | 74de1ff851 |
501942843473 has 2 divisors, whose sum is σ = 501942843474. Its totient is φ = 501942843472.
The previous prime is 501942843403. The next prime is 501942843481. The reversal of 501942843473 is 374348249105.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 307017944464 + 194924899009 = 554092^2 + 441503^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-501942843473 is a prime.
It is a super-4 number, since 4×5019428434734 (a number of 48 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (501942843403) 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, 250971421736 + 250971421737.
It is an arithmetic number, because the mean of its divisors is an integer number (250971421737).
Almost surely, 2501942843473 is an apocalyptic number.
It is an amenable number.
501942843473 is a deficient number, since it is larger than the sum of its proper divisors (1).
501942843473 is an equidigital number, since it uses as much as digits as its factorization.
501942843473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2903040, while the sum is 50.
The spelling of 501942843473 in words is "five hundred one billion, nine hundred forty-two million, eight hundred forty-three thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •