Base | Representation |
---|---|
bin | 11000000110110110100100… |
… | …00011001000011001111101 |
3 | 20221200220021011010020210111 |
4 | 30003123102003020121331 |
5 | 23422022044130402303 |
6 | 304425214213310021 |
7 | 14110664015421553 |
oct | 1403332203103175 |
9 | 227626234106714 |
10 | 53012010403453 |
11 | 159892a3941732 |
12 | 5b420bb035311 |
13 | 237701b5baa8a |
14 | d13b1b669bd3 |
15 | 61de6d9cbb6d |
hex | 3036d20c867d |
53012010403453 has 4 divisors (see below), whose sum is σ = 53047660714560. Its totient is φ = 52976360092348.
The previous prime is 53012010403441. The next prime is 53012010403481. The reversal of 53012010403453 is 35430401021035.
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 a cyclic number.
It is not a de Polignac number, because 53012010403453 - 29 = 53012010402941 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 (53012010409453) 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, 17825153323 + ... + 17825156296.
It is an arithmetic number, because the mean of its divisors is an integer number (13261915178640).
Almost surely, 253012010403453 is an apocalyptic number.
It is an amenable number.
53012010403453 is a deficient number, since it is larger than the sum of its proper divisors (35650311107).
53012010403453 is a wasteful number, since it uses less digits than its factorization.
53012010403453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35650311106.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 53012010403453 its reverse (35430401021035), we get a palindrome (88442411424488).
The spelling of 53012010403453 in words is "fifty-three trillion, twelve billion, ten million, four hundred three thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •