Base | Representation |
---|---|
bin | 100101001100101010010… |
… | …0110000010111111100011 |
3 | 200002202002001122021102012 |
4 | 1022121110212002333203 |
5 | 1132230224131421430 |
6 | 14512341300543135 |
7 | 1035234534621125 |
oct | 112312446027743 |
9 | 20082061567365 |
10 | 5112430342115 |
11 | 16a1195713678 |
12 | 6a69a66b1aab |
13 | 2b113bc41715 |
14 | 13962b647215 |
15 | 8cebcd85695 |
hex | 4a654982fe3 |
5112430342115 has 8 divisors (see below), whose sum is σ = 6495793846560. Its totient is φ = 3849359316352.
The previous prime is 5112430342109. The next prime is 5112430342121.
5112430342115 is nontrivially palindromic in base 10.
It is an interprime number because it is at equal distance from previous prime (5112430342109) and next prime (5112430342121).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5112430342115 - 214 = 5112430325731 is a prime.
It is a super-2 number, since 2×51124303421152 (a number of 26 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30073119575 + ... + 30073119744.
It is an arithmetic number, because the mean of its divisors is an integer number (811974230820).
Almost surely, 25112430342115 is an apocalyptic number.
5112430342115 is a deficient number, since it is larger than the sum of its proper divisors (1383363504445).
5112430342115 is a wasteful number, since it uses less digits than its factorization.
5112430342115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60146239341.
The product of its (nonzero) digits is 14400, while the sum is 32.
It can be divided in two parts, 5112430 and 342115, that added together give a palindrome (5454545).
The spelling of 5112430342115 in words is "five trillion, one hundred twelve billion, four hundred thirty million, three hundred forty-two thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •