Base | Representation |
---|---|
bin | 1001111000011011… |
… | …10011110000010011 |
3 | 111200201201002211220 |
4 | 10330031303300103 |
5 | 41331114020430 |
6 | 2234233140123 |
7 | 245316425016 |
oct | 47415636023 |
9 | 14621632756 |
10 | 5305220115 |
11 | 2282727438 |
12 | 104085a643 |
13 | 667166700 |
14 | 38483337d |
15 | 210b47110 |
hex | 13c373c13 |
5305220115 has 96 divisors (see below), whose sum is σ = 9486720000. Its totient is φ = 2529386496.
The previous prime is 5305220111. The next prime is 5305220161. The reversal of 5305220115 is 5110225035.
It is a happy number.
5305220115 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5305220115 - 22 = 5305220111 is a prime.
It is a super-2 number, since 2×53052201152 = 56290720937201226450, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5305220111) 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 95 ways as a sum of consecutive naturals, for example, 11815411 + ... + 11815859.
It is an arithmetic number, because the mean of its divisors is an integer number (98820000).
Almost surely, 25305220115 is an apocalyptic number.
5305220115 is a deficient number, since it is larger than the sum of its proper divisors (4181499885).
5305220115 is a wasteful number, since it uses less digits than its factorization.
5305220115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 621 (or 608 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 24.
The square root of 5305220115 is about 72836.9419662852. The cubic root of 5305220115 is about 1744.0856247896.
The spelling of 5305220115 in words is "five billion, three hundred five million, two hundred twenty thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •