Base | Representation |
---|---|
bin | 111000111010100000110011… |
… | …1111001110111100111000001 |
3 | 2102122120002210202221200210021 |
4 | 1301311001213321313213001 |
5 | 1011104202133044314433 |
6 | 4532423031434533441 |
7 | 210306553612226641 |
oct | 16165014771674701 |
9 | 2378502722850707 |
10 | 500623131244993 |
11 | 135572094408069 |
12 | 48194149897281 |
13 | 186457356436c3 |
14 | 8b8a4087d4521 |
15 | 3cd255335322d |
hex | 1c75067e779c1 |
500623131244993 has 2 divisors, whose sum is σ = 500623131244994. Its totient is φ = 500623131244992.
The previous prime is 500623131244987. The next prime is 500623131244997. The reversal of 500623131244993 is 399442131326005.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 477340653408129 + 23282477836864 = 21848127^2 + 4825192^2 .
It is a cyclic number.
It is not a de Polignac number, because 500623131244993 - 213 = 500623131236801 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 500623131244993.
It is not a weakly prime, because it can be changed into another prime (500623131244997) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 250311565622496 + 250311565622497.
It is an arithmetic number, because the mean of its divisors is an integer number (250311565622497).
Almost surely, 2500623131244993 is an apocalyptic number.
It is an amenable number.
500623131244993 is a deficient number, since it is larger than the sum of its proper divisors (1).
500623131244993 is an equidigital number, since it uses as much as digits as its factorization.
500623131244993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4199040, while the sum is 52.
The spelling of 500623131244993 in words is "five hundred trillion, six hundred twenty-three billion, one hundred thirty-one million, two hundred forty-four thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •