Base | Representation |
---|---|
bin | 1110100011011011010… |
… | …10101011011111111001 |
3 | 1202210201202210110012022 |
4 | 13101231222223133321 |
5 | 31143103331023342 |
6 | 1021420025524225 |
7 | 51061566545504 |
oct | 7215552533771 |
9 | 1683652713168 |
10 | 500056111097 |
11 | 183088702604 |
12 | 80ab7943675 |
13 | 382029658ca |
14 | 1a2ba86c13b |
15 | d01aa189d2 |
hex | 746daab7f9 |
500056111097 has 2 divisors, whose sum is σ = 500056111098. Its totient is φ = 500056111096.
The previous prime is 500056111063. The next prime is 500056111117. The reversal of 500056111097 is 790111650005.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 455133732496 + 44922378601 = 674636^2 + 211949^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-500056111097 is a prime.
It is a super-2 number, since 2×5000561110972 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (500056111297) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 250028055548 + 250028055549.
It is an arithmetic number, because the mean of its divisors is an integer number (250028055549).
Almost surely, 2500056111097 is an apocalyptic number.
It is an amenable number.
500056111097 is a deficient number, since it is larger than the sum of its proper divisors (1).
500056111097 is an equidigital number, since it uses as much as digits as its factorization.
500056111097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9450, while the sum is 35.
The spelling of 500056111097 in words is "five hundred billion, fifty-six million, one hundred eleven thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •