Base | Representation |
---|---|
bin | 1001010111101111… |
… | …10110110011111101 |
3 | 110222121202210201221 |
4 | 10223313312303331 |
5 | 40300420430023 |
6 | 2151120233341 |
7 | 235450022662 |
oct | 45367666375 |
9 | 13877683657 |
10 | 5031030013 |
11 | 2151981349 |
12 | b84a6b851 |
13 | 622404649 |
14 | 35a25ba69 |
15 | 1e6a3585d |
hex | 12bdf6cfd |
5031030013 has 2 divisors, whose sum is σ = 5031030014. Its totient is φ = 5031030012.
The previous prime is 5031029999. The next prime is 5031030019. The reversal of 5031030013 is 3100301305.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3960562489 + 1070467524 = 62933^2 + 32718^2 .
It is a cyclic number.
It is not a de Polignac number, because 5031030013 - 25 = 5031029981 is a prime.
It is a super-2 number, since 2×50310300132 = 50622525983413560338, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5031030019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2515515006 + 2515515007.
It is an arithmetic number, because the mean of its divisors is an integer number (2515515007).
Almost surely, 25031030013 is an apocalyptic number.
It is an amenable number.
5031030013 is a deficient number, since it is larger than the sum of its proper divisors (1).
5031030013 is an equidigital number, since it uses as much as digits as its factorization.
5031030013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135, while the sum is 16.
The square root of 5031030013 is about 70929.7540740133. The cubic root of 5031030013 is about 1713.5060258800.
Adding to 5031030013 its reverse (3100301305), we get a palindrome (8131331318).
The spelling of 5031030013 in words is "five billion, thirty-one million, thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •