Base | Representation |
---|---|
bin | 1001100000010111… |
… | …00110000110110011 |
3 | 111011122210011210212 |
4 | 10300023212012303 |
5 | 40422422011311 |
6 | 2202221414335 |
7 | 240315306344 |
oct | 46013460663 |
9 | 14148704725 |
10 | 5103313331 |
11 | 2189761926 |
12 | ba510a3ab |
13 | 63439253c |
14 | 365ab60cb |
15 | 1ed062c8b |
hex | 1302e61b3 |
5103313331 has 4 divisors (see below), whose sum is σ = 5118457032. Its totient is φ = 5088169632.
The previous prime is 5103313321. The next prime is 5103313339. The reversal of 5103313331 is 1333133015.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5103313331 is a prime.
It is a super-2 number, since 2×51033133312 = 52087613908724631122, 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 = 5103313297 and 5103313306.
It is not an unprimeable number, because it can be changed into a prime (5103313339) 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, 7571345 + ... + 7572018.
It is an arithmetic number, because the mean of its divisors is an integer number (1279614258).
Almost surely, 25103313331 is an apocalyptic number.
5103313331 is a deficient number, since it is larger than the sum of its proper divisors (15143701).
5103313331 is a wasteful number, since it uses less digits than its factorization.
5103313331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15143700.
The product of its (nonzero) digits is 1215, while the sum is 23.
The square root of 5103313331 is about 71437.4784759373. The cubic root of 5103313331 is about 1721.6733007311.
Adding to 5103313331 its reverse (1333133015), we get a palindrome (6436446346).
The spelling of 5103313331 in words is "five billion, one hundred three million, three hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.171 sec. • engine limits •