Base | Representation |
---|---|
bin | 1001100000010001… |
… | …01000000101110111 |
3 | 111011121022122011221 |
4 | 10300020220011313 |
5 | 40422222110111 |
6 | 2202153011211 |
7 | 240305555266 |
oct | 46010500567 |
9 | 14147278157 |
10 | 5102535031 |
11 | 2189280100 |
12 | ba49b3b07 |
13 | 63417c1c9 |
14 | 3659525dd |
15 | 1ece5c371 |
hex | 130228177 |
5102535031 has 6 divisors (see below), whose sum is σ = 5608571696. Its totient is φ = 4638668100.
The previous prime is 5102535017. The next prime is 5102535043. The reversal of 5102535031 is 1305352015.
It is not a de Polignac number, because 5102535031 - 25 = 5102534999 is a prime.
It is a super-2 number, since 2×51025350312 = 52071727485164341922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5102534987 and 5102535005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5102535131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 21084735 + ... + 21084976.
Almost surely, 25102535031 is an apocalyptic number.
5102535031 is a deficient number, since it is larger than the sum of its proper divisors (506036665).
5102535031 is a wasteful number, since it uses less digits than its factorization.
5102535031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42169733 (or 42169722 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 25.
The square root of 5102535031 is about 71432.0308475127. The cubic root of 5102535031 is about 1721.5857728599.
Adding to 5102535031 its reverse (1305352015), we get a palindrome (6407887046).
The spelling of 5102535031 in words is "five billion, one hundred two million, five hundred thirty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •