Base | Representation |
---|---|
bin | 100101001101000010111… |
… | …0000010111111101111011 |
3 | 200002211012112121222212122 |
4 | 1022122011300113331323 |
5 | 1132233421303224201 |
6 | 14512555203031455 |
7 | 1035264141336332 |
oct | 112320560277573 |
9 | 20084175558778 |
10 | 5113255133051 |
11 | 16a157924727a |
12 | 6a6b9696b58b |
13 | 2b1240a945b0 |
14 | 1396a8dc6d19 |
15 | 8d01a4a7e1b |
hex | 4a685c17f7b |
5113255133051 has 8 divisors (see below), whose sum is σ = 5696464604880. Its totient is φ = 4557171683232.
The previous prime is 5113255133033. The next prime is 5113255133069. The reversal of 5113255133051 is 1503315523115.
It is an interprime number because it is at equal distance from previous prime (5113255133033) and next prime (5113255133069).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5113255133051 is a prime.
It is a super-2 number, since 2×51132551330512 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5113255133081) 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, 6781505105 + ... + 6781505858.
It is an arithmetic number, because the mean of its divisors is an integer number (712058075610).
Almost surely, 25113255133051 is an apocalyptic number.
5113255133051 is a deficient number, since it is larger than the sum of its proper divisors (583209471829).
5113255133051 is a wasteful number, since it uses less digits than its factorization.
5113255133051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13563011005.
The product of its (nonzero) digits is 33750, while the sum is 35.
The spelling of 5113255133051 in words is "five trillion, one hundred thirteen billion, two hundred fifty-five million, one hundred thirty-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •