Base | Representation |
---|---|
bin | 11000000111100001110100… |
… | …00111111110011011011101 |
3 | 20221210010012110102001200210 |
4 | 30003300322013332123131 |
5 | 23422412123210342003 |
6 | 304444014322443033 |
7 | 14112445321216011 |
oct | 1403607207763335 |
9 | 227703173361623 |
10 | 53035231340253 |
11 | 1599812a514198 |
12 | 5b466bb803479 |
13 | 237927c384b76 |
14 | d14cc162a541 |
15 | 61e87c3ce503 |
hex | 303c3a1fe6dd |
53035231340253 has 4 divisors (see below), whose sum is σ = 70713641787008. Its totient is φ = 35356820893500.
The previous prime is 53035231340249. The next prime is 53035231340317. The reversal of 53035231340253 is 35204313253035.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 53035231340253 - 22 = 53035231340249 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 (53035231340053) 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, 8839205223373 + ... + 8839205223378.
It is an arithmetic number, because the mean of its divisors is an integer number (17678410446752).
Almost surely, 253035231340253 is an apocalyptic number.
It is an amenable number.
53035231340253 is a deficient number, since it is larger than the sum of its proper divisors (17678410446755).
53035231340253 is a wasteful number, since it uses less digits than its factorization.
53035231340253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17678410446754.
The product of its (nonzero) digits is 486000, while the sum is 39.
Adding to 53035231340253 its reverse (35204313253035), we get a palindrome (88239544593288).
The spelling of 53035231340253 in words is "fifty-three trillion, thirty-five billion, two hundred thirty-one million, three hundred forty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •