Base | Representation |
---|---|
bin | 1110100101001011110… |
… | …11101101100010100001 |
3 | 1202220011120002001112022 |
4 | 13102211323231202201 |
5 | 31202022011200001 |
6 | 1022053430511225 |
7 | 51124151404652 |
oct | 7224573554241 |
9 | 1686146061468 |
10 | 501000100001 |
11 | 18352254a425 |
12 | 8111bb05515 |
13 | 383233c161b |
14 | 1a369d99529 |
15 | d07383411b |
hex | 74a5eed8a1 |
501000100001 has 2 divisors, whose sum is σ = 501000100002. Its totient is φ = 501000100000.
The previous prime is 501000099959. The next prime is 501000100009. The reversal of 501000100001 is 100001000105.
It is a happy number.
It is an a-pointer prime, because the next prime (501000100009) can be obtained adding 501000100001 to its sum of digits (8).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 288825630625 + 212174469376 = 537425^2 + 460624^2 .
It is a cyclic number.
It is not a de Polignac number, because 501000100001 - 26 = 501000099937 is a prime.
It is a super-2 number, since 2×5010001000012 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (501000100009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 250500050000 + 250500050001.
It is an arithmetic number, because the mean of its divisors is an integer number (250500050001).
Almost surely, 2501000100001 is an apocalyptic number.
It is an amenable number.
501000100001 is a deficient number, since it is larger than the sum of its proper divisors (1).
501000100001 is an equidigital number, since it uses as much as digits as its factorization.
501000100001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5, while the sum is 8.
Adding to 501000100001 its reverse (100001000105), we get a palindrome (601001100106).
The spelling of 501000100001 in words is "five hundred one billion, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •