Base | Representation |
---|---|
bin | 1001100000010110… |
… | …10111011011101001 |
3 | 111011122200010100201 |
4 | 10300023113123221 |
5 | 40422413100400 |
6 | 2202220232201 |
7 | 240314636200 |
oct | 46013273351 |
9 | 14148603321 |
10 | 5103253225 |
11 | 2189720754 |
12 | ba509b661 |
13 | 634371085 |
14 | 365a9c237 |
15 | 1ed05006a |
hex | 1302d76e9 |
5103253225 has 72 divisors (see below), whose sum is σ = 8086357440. Its totient is φ = 3170724480.
The previous prime is 5103253223. The next prime is 5103253277. The reversal of 5103253225 is 5223523015.
It is not a de Polignac number, because 5103253225 - 21 = 5103253223 is a prime.
It is a super-3 number, since 3×51032532253 (a number of 30 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5103253193 and 5103253202.
It is not an unprimeable number, because it can be changed into a prime (5103253223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 530559 + ... + 540091.
It is an arithmetic number, because the mean of its divisors is an integer number (112310520).
Almost surely, 25103253225 is an apocalyptic number.
It is an amenable number.
5103253225 is a deficient number, since it is larger than the sum of its proper divisors (2983104215).
5103253225 is a wasteful number, since it uses less digits than its factorization.
5103253225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9599 (or 9587 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 28.
The square root of 5103253225 is about 71437.0577851580. The cubic root of 5103253225 is about 1721.6665415079. Note that the first 3 decimals are identical.
The spelling of 5103253225 in words is "five billion, one hundred three million, two hundred fifty-three thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •