Base | Representation |
---|---|
bin | 100100110001000110101… |
… | …0011000101110111010111 |
3 | 122220002022211101201212220 |
4 | 1021202031103011313113 |
5 | 1130243030021213221 |
6 | 14425233150313423 |
7 | 1031041204263165 |
oct | 111421523056727 |
9 | 18802284351786 |
10 | 5053252132311 |
11 | 16790880aa769 |
12 | 69742bab8873 |
13 | 2a869a826626 |
14 | 136815d92235 |
15 | 8b6a78610c6 |
hex | 4988d4c5dd7 |
5053252132311 has 4 divisors (see below), whose sum is σ = 6737669509752. Its totient is φ = 3368834754872.
The previous prime is 5053252132301. The next prime is 5053252132471. The reversal of 5053252132311 is 1132312523505.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5053252132311 - 29 = 5053252131799 is a prime.
It is a super-3 number, since 3×50532521323113 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5053252132301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 842208688716 + ... + 842208688721.
It is an arithmetic number, because the mean of its divisors is an integer number (1684417377438).
Almost surely, 25053252132311 is an apocalyptic number.
5053252132311 is a deficient number, since it is larger than the sum of its proper divisors (1684417377441).
5053252132311 is a wasteful number, since it uses less digits than its factorization.
5053252132311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1684417377440.
The product of its (nonzero) digits is 27000, while the sum is 33.
Adding to 5053252132311 its reverse (1132312523505), we get a palindrome (6185564655816).
The spelling of 5053252132311 in words is "five trillion, fifty-three billion, two hundred fifty-two million, one hundred thirty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •