Base | Representation |
---|---|
bin | 111000110111101111011001… |
… | …1010001110101111100110101 |
3 | 2102121012200102002201201012201 |
4 | 1301233132303101311330311 |
5 | 1011031431402243402014 |
6 | 4531532022430144501 |
7 | 210240205441625524 |
oct | 16157366321657465 |
9 | 2377180362651181 |
10 | 500242143731509 |
11 | 13543555793a243 |
12 | 48132341952131 |
13 | 18618829c253aa |
14 | 8b75bc56da4bb |
15 | 3cc76a5b5de74 |
hex | 1c6f7b3475f35 |
500242143731509 has 2 divisors, whose sum is σ = 500242143731510. Its totient is φ = 500242143731508.
The previous prime is 500242143731497. The next prime is 500242143731537. The reversal of 500242143731509 is 905137341242005.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 499449999230884 + 792144500625 = 22348378^2 + 890025^2 .
It is a cyclic number.
It is not a de Polignac number, because 500242143731509 - 239 = 499692387917621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (500242143738509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 250121071865754 + 250121071865755.
It is an arithmetic number, because the mean of its divisors is an integer number (250121071865755).
Almost surely, 2500242143731509 is an apocalyptic number.
It is an amenable number.
500242143731509 is a deficient number, since it is larger than the sum of its proper divisors (1).
500242143731509 is an equidigital number, since it uses as much as digits as its factorization.
500242143731509 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 907200, while the sum is 46.
The spelling of 500242143731509 in words is "five hundred trillion, two hundred forty-two billion, one hundred forty-three million, seven hundred thirty-one thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •