Base | Representation |
---|---|
bin | 100110100101001010111… |
… | …0011110010100111010111 |
3 | 200202220200112221000010001 |
4 | 1031022111303302213113 |
5 | 1143334011233300421 |
6 | 15135534122112131 |
7 | 1055043653023015 |
oct | 115122563624727 |
9 | 20686615830101 |
10 | 5302503025111 |
11 | 17648627a3656 |
12 | 7177b164b647 |
13 | 2c6040641206 |
14 | 1448dd0c58b5 |
15 | 92de4a07691 |
hex | 4d295cf29d7 |
5302503025111 has 16 divisors (see below), whose sum is σ = 5568961950720. Its totient is φ = 5042089704960.
The previous prime is 5302503025109. The next prime is 5302503025189. The reversal of 5302503025111 is 1115203052035.
It is a cyclic number.
It is not a de Polignac number, because 5302503025111 - 21 = 5302503025109 is a prime.
It is a super-2 number, since 2×53025030251112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5302503025111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5302503025411) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3178656 + ... + 4550698.
It is an arithmetic number, because the mean of its divisors is an integer number (348060121920).
Almost surely, 25302503025111 is an apocalyptic number.
5302503025111 is a deficient number, since it is larger than the sum of its proper divisors (266458925609).
5302503025111 is a wasteful number, since it uses less digits than its factorization.
5302503025111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1374246.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 5302503025111 its reverse (1115203052035), we get a palindrome (6417706077146).
The spelling of 5302503025111 in words is "five trillion, three hundred two billion, five hundred three million, twenty-five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •