Base | Representation |
---|---|
bin | 1001100000001000… |
… | …00010111111100101 |
3 | 111011112001122100212 |
4 | 10300010002333211 |
5 | 40421420201001 |
6 | 2202111145205 |
7 | 240262425224 |
oct | 46004027745 |
9 | 14145048325 |
10 | 5101334501 |
11 | 218863012a |
12 | ba4515205 |
13 | 633b4b933 |
14 | 36571ccbb |
15 | 1eccc17bb |
hex | 130102fe5 |
5101334501 has 2 divisors, whose sum is σ = 5101334502. Its totient is φ = 5101334500.
The previous prime is 5101334443. The next prime is 5101334521. The reversal of 5101334501 is 1054331015.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4257432001 + 843902500 = 65249^2 + 29050^2 .
It is a cyclic number.
It is not a de Polignac number, because 5101334501 - 210 = 5101333477 is a prime.
It is a super-2 number, since 2×51013345012 = 52047227382185838002, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5101334521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2550667250 + 2550667251.
It is an arithmetic number, because the mean of its divisors is an integer number (2550667251).
Almost surely, 25101334501 is an apocalyptic number.
It is an amenable number.
5101334501 is a deficient number, since it is larger than the sum of its proper divisors (1).
5101334501 is an equidigital number, since it uses as much as digits as its factorization.
5101334501 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 900, while the sum is 23.
The square root of 5101334501 is about 71423.6270501576. The cubic root of 5101334501 is about 1721.4507434108.
Adding to 5101334501 its reverse (1054331015), we get a palindrome (6155665516).
The spelling of 5101334501 in words is "five billion, one hundred one million, three hundred thirty-four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •