Base | Representation |
---|---|
bin | 1001100000011000… |
… | …11011100111100001 |
3 | 111011200012022110201 |
4 | 10300030123213201 |
5 | 40423001020023 |
6 | 2202230225201 |
7 | 240320211352 |
oct | 46014334741 |
9 | 14150168421 |
10 | 5103532513 |
11 | 21898a1572 |
12 | ba51b5201 |
13 | 63443b231 |
14 | 365b31d29 |
15 | 1ed0a7bad |
hex | 13031b9e1 |
5103532513 has 4 divisors (see below), whose sum is σ = 5103687600. Its totient is φ = 5103377428.
The previous prime is 5103532501. The next prime is 5103532547. The reversal of 5103532513 is 3152353015.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5103532513 - 29 = 5103532001 is a prime.
It is a super-2 number, since 2×51035325132 = 52092088222496190338, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5103532613) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6463 + ... + 101236.
It is an arithmetic number, because the mean of its divisors is an integer number (1275921900).
Almost surely, 25103532513 is an apocalyptic number.
It is an amenable number.
5103532513 is a deficient number, since it is larger than the sum of its proper divisors (155087).
5103532513 is a wasteful number, since it uses less digits than its factorization.
5103532513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155086.
The product of its (nonzero) digits is 6750, while the sum is 28.
The square root of 5103532513 is about 71439.0125421677. The cubic root of 5103532513 is about 1721.6979484041.
Adding to 5103532513 its reverse (3152353015), we get a palindrome (8255885528).
The spelling of 5103532513 in words is "five billion, one hundred three million, five hundred thirty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •