Base | Representation |
---|---|
bin | 100110100101100110010… |
… | …1101111011001001000101 |
3 | 200210000001202100021012202 |
4 | 1031023030231323021011 |
5 | 1143342403100442203 |
6 | 15140205350524245 |
7 | 1055105540124251 |
oct | 115131455731105 |
9 | 20700052307182 |
10 | 5303424234053 |
11 | 17651957a1560 |
12 | 717a0a066685 |
13 | 2c615945236a |
14 | 1449895a3261 |
15 | 92e4a823388 |
hex | 4d2ccb7b245 |
5303424234053 has 8 divisors (see below), whose sum is σ = 5785623762816. Its totient is φ = 4821236380800.
The previous prime is 5303424234047. The next prime is 5303424234079. The reversal of 5303424234053 is 3504324243035.
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 5303424234053 - 232 = 5299129266757 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5303424233998 and 5303424234016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5303424234013) 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, 1955276 + ... + 3798677.
It is an arithmetic number, because the mean of its divisors is an integer number (723202970352).
Almost surely, 25303424234053 is an apocalyptic number.
It is an amenable number.
5303424234053 is a deficient number, since it is larger than the sum of its proper divisors (482199528763).
5303424234053 is a wasteful number, since it uses less digits than its factorization.
5303424234053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5837755.
The product of its (nonzero) digits is 518400, while the sum is 38.
Adding to 5303424234053 its reverse (3504324243035), we get a palindrome (8807748477088).
The spelling of 5303424234053 in words is "five trillion, three hundred three billion, four hundred twenty-four million, two hundred thirty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •