Base | Representation |
---|---|
bin | 1001100011100011… |
… | …00000111110100101 |
3 | 111020112001120120122 |
4 | 10301301200332211 |
5 | 41001241443023 |
6 | 2205014211325 |
7 | 241061354432 |
oct | 46161407645 |
9 | 14215046518 |
10 | 5130031013 |
11 | 21a2850258 |
12 | bb2053b45 |
13 | 639a88513 |
14 | 36946cb89 |
15 | 20058e2c8 |
hex | 131c60fa5 |
5130031013 has 2 divisors, whose sum is σ = 5130031014. Its totient is φ = 5130031012.
The previous prime is 5130030977. The next prime is 5130031031. The reversal of 5130031013 is 3101300315.
Together with next prime (5130031031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5128994689 + 1036324 = 71617^2 + 1018^2 .
It is a cyclic number.
It is not a de Polignac number, because 5130031013 - 212 = 5130026917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5130030982 and 5130031000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5130031033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2565015506 + 2565015507.
It is an arithmetic number, because the mean of its divisors is an integer number (2565015507).
Almost surely, 25130031013 is an apocalyptic number.
It is an amenable number.
5130031013 is a deficient number, since it is larger than the sum of its proper divisors (1).
5130031013 is an equidigital number, since it uses as much as digits as its factorization.
5130031013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 135, while the sum is 17.
The square root of 5130031013 is about 71624.2348161570. The cubic root of 5130031013 is about 1724.6725991257.
Adding to 5130031013 its reverse (3101300315), we get a palindrome (8231331328).
The spelling of 5130031013 in words is "five billion, one hundred thirty million, thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •