Base | Representation |
---|---|
bin | 1001111000000100… |
… | …10110000111011111 |
3 | 111200112001102210100 |
4 | 10330002112013133 |
5 | 41324331341020 |
6 | 2234044512143 |
7 | 245252041110 |
oct | 47402260737 |
9 | 14615042710 |
10 | 5302215135 |
11 | 2280a64788 |
12 | 103b84b653 |
13 | 666653a09 |
14 | 384290207 |
15 | 210751a90 |
hex | 13c0961df |
5302215135 has 48 divisors (see below), whose sum is σ = 10701647424. Its totient is φ = 2378128896.
The previous prime is 5302215091. The next prime is 5302215157. The reversal of 5302215135 is 5315122035.
It is a happy number.
It is not a de Polignac number, because 5302215135 - 26 = 5302215071 is a prime.
It is a super-2 number, since 2×53022151352 = 56226970675646136450, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5302215099 and 5302215108.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 142102 + ... + 175491.
It is an arithmetic number, because the mean of its divisors is an integer number (222950988).
Almost surely, 25302215135 is an apocalyptic number.
5302215135 is an abundant number, since it is smaller than the sum of its proper divisors (5399432289).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5302215135 is a wasteful number, since it uses less digits than its factorization.
5302215135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317664 (or 317661 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
The square root of 5302215135 is about 72816.3109131464. The cubic root of 5302215135 is about 1743.7562679083.
The spelling of 5302215135 in words is "five billion, three hundred two million, two hundred fifteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •