Base | Representation |
---|---|
bin | 11101110111101… |
… | …110100101101101 |
3 | 1021220222221211112 |
4 | 131313232211231 |
5 | 2011243214023 |
6 | 121421201405 |
7 | 15263454632 |
oct | 3567564555 |
9 | 1256887745 |
10 | 501148013 |
11 | 237980a13 |
12 | 11ba00265 |
13 | 7ca977b2 |
14 | 4a7b4189 |
15 | 2dee3478 |
hex | 1ddee96d |
501148013 has 2 divisors, whose sum is σ = 501148014. Its totient is φ = 501148012.
The previous prime is 501147979. The next prime is 501148027. The reversal of 501148013 is 310841105.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 456164164 + 44983849 = 21358^2 + 6707^2 .
It is a cyclic number.
It is not a de Polignac number, because 501148013 - 212 = 501143917 is a prime.
It is a super-3 number, since 3×5011480133 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 501148013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (501148213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 250574006 + 250574007.
It is an arithmetic number, because the mean of its divisors is an integer number (250574007).
Almost surely, 2501148013 is an apocalyptic number.
It is an amenable number.
501148013 is a deficient number, since it is larger than the sum of its proper divisors (1).
501148013 is an equidigital number, since it uses as much as digits as its factorization.
501148013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 480, while the sum is 23.
The square root of 501148013 is about 22386.3354080117. The cubic root of 501148013 is about 794.3075140154.
Adding to 501148013 its reverse (310841105), we get a palindrome (811989118).
The spelling of 501148013 in words is "five hundred one million, one hundred forty-eight thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •