Base | Representation |
---|---|
bin | 100101001100111011101… |
… | …1101010001000111101001 |
3 | 200002210120211020022220212 |
4 | 1022121313131101013221 |
5 | 1132232423400240431 |
6 | 14512515313230505 |
7 | 1035255166323203 |
oct | 112316735210751 |
9 | 20083524208825 |
10 | 5113015243241 |
11 | 16a1465899534 |
12 | 6a6b2a562435 |
13 | 2b1203181969 |
14 | 1396851bd773 |
15 | 8d0043be72b |
hex | 4a6777511e9 |
5113015243241 has 16 divisors (see below), whose sum is σ = 5193364420608. Its totient is φ = 5033259302400.
The previous prime is 5113015243211. The next prime is 5113015243267. The reversal of 5113015243241 is 1423425103115.
It is a cyclic number.
It is not a de Polignac number, because 5113015243241 - 230 = 5111941501417 is a prime.
It is a super-2 number, since 2×51130152432412 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5113015243198 and 5113015243207.
It is not an unprimeable number, because it can be changed into a prime (5113015243211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 33961511 + ... + 34111731.
It is an arithmetic number, because the mean of its divisors is an integer number (324585276288).
Almost surely, 25113015243241 is an apocalyptic number.
It is an amenable number.
5113015243241 is a deficient number, since it is larger than the sum of its proper divisors (80349177367).
5113015243241 is a wasteful number, since it uses less digits than its factorization.
5113015243241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152192.
The product of its (nonzero) digits is 14400, while the sum is 32.
The spelling of 5113015243241 in words is "five trillion, one hundred thirteen billion, fifteen million, two hundred forty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •