Base | Representation |
---|---|
bin | 100101010110010110110… |
… | …0110111100010101100101 |
3 | 200011201211002120110122011 |
4 | 1022230231212330111211 |
5 | 1133100344240231203 |
6 | 14530103310034221 |
7 | 1036602514304134 |
oct | 112545546742545 |
9 | 20151732513564 |
10 | 5133251102053 |
11 | 16a9aaa472798 |
12 | 6aaa374a8971 |
13 | 2b30a968a509 |
14 | 13a64493d91b |
15 | 8d7dabc976d |
hex | 4ab2d9bc565 |
5133251102053 has 8 divisors (see below), whose sum is σ = 5232039256800. Its totient is φ = 5034855744048.
The previous prime is 5133251102051. The next prime is 5133251102153. The reversal of 5133251102053 is 3502011523315.
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 5133251102053 - 21 = 5133251102051 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5133251102051) 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 7 ways as a sum of consecutive naturals, for example, 98172798 + ... + 98225071.
It is an arithmetic number, because the mean of its divisors is an integer number (654004907100).
Almost surely, 25133251102053 is an apocalyptic number.
It is an amenable number.
5133251102053 is a deficient number, since it is larger than the sum of its proper divisors (98788154747).
5133251102053 is a wasteful number, since it uses less digits than its factorization.
5133251102053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196398371.
The product of its (nonzero) digits is 13500, while the sum is 31.
Adding to 5133251102053 its reverse (3502011523315), we get a palindrome (8635262625368).
The spelling of 5133251102053 in words is "five trillion, one hundred thirty-three billion, two hundred fifty-one million, one hundred two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •