Base | Representation |
---|---|
bin | 1001100000001110… |
… | …00011000100100101 |
3 | 111011120112121120211 |
4 | 10300013003010211 |
5 | 40422120340003 |
6 | 2202140055421 |
7 | 240302213035 |
oct | 46007030445 |
9 | 14146477524 |
10 | 5102121253 |
11 | 2189018239 |
12 | ba4834571 |
13 | 634065a78 |
14 | 3658858c5 |
15 | 1ecdc996d |
hex | 1301c3125 |
5102121253 has 4 divisors (see below), whose sum is σ = 5240016460. Its totient is φ = 4964226048.
The previous prime is 5102121197. The next prime is 5102121259. The reversal of 5102121253 is 3521212015.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3297400929 + 1804720324 = 57423^2 + 42482^2 .
It is a cyclic number.
It is not a de Polignac number, because 5102121253 - 29 = 5102120741 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5102121259) 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, 68947548 + ... + 68947621.
It is an arithmetic number, because the mean of its divisors is an integer number (1310004115).
Almost surely, 25102121253 is an apocalyptic number.
It is an amenable number.
5102121253 is a deficient number, since it is larger than the sum of its proper divisors (137895207).
5102121253 is a wasteful number, since it uses less digits than its factorization.
5102121253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 137895206.
The product of its (nonzero) digits is 600, while the sum is 22.
The square root of 5102121253 is about 71429.1344830665. The cubic root of 5102121253 is about 1721.5392356276.
Adding to 5102121253 its reverse (3521212015), we get a palindrome (8623333268).
The spelling of 5102121253 in words is "five billion, one hundred two million, one hundred twenty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •