Base | Representation |
---|---|
bin | 100100011111011100110… |
… | …1001100011000111001001 |
3 | 122202110110202212122021111 |
4 | 1020332321221203013021 |
5 | 1124132404411323423 |
6 | 14400003250210321 |
7 | 1025226560311603 |
oct | 110767151430711 |
9 | 18673422778244 |
10 | 5015341511113 |
11 | 1663aa359596a |
12 | 69000b8839a1 |
13 | 2a4c385b36ab |
14 | 134a5b0a8173 |
15 | 8a6d94e460d |
hex | 48fb9a631c9 |
5015341511113 has 8 divisors (see below), whose sum is σ = 5316004934280. Its totient is φ = 4715305125120.
The previous prime is 5015341511099. The next prime is 5015341511123. The reversal of 5015341511113 is 3111151435105.
It can be written as a sum of positive squares in 4 ways, for example, as 1436706685129 + 3578634825984 = 1198627^2 + 1891728^2 .
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 5015341511113 - 217 = 5015341380041 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5015341511123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 156742818 + ... + 156774811.
It is an arithmetic number, because the mean of its divisors is an integer number (664500616785).
Almost surely, 25015341511113 is an apocalyptic number.
It is an amenable number.
5015341511113 is a deficient number, since it is larger than the sum of its proper divisors (300663423167).
5015341511113 is a wasteful number, since it uses less digits than its factorization.
5015341511113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 313518587.
The product of its (nonzero) digits is 4500, while the sum is 31.
Adding to 5015341511113 its reverse (3111151435105), we get a palindrome (8126492946218).
The spelling of 5015341511113 in words is "five trillion, fifteen billion, three hundred forty-one million, five hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •