Base | Representation |
---|---|
bin | 11000001100101101010101… |
… | …01010001110010010000101 |
3 | 20222102010121022100110110222 |
4 | 30012112222222032102011 |
5 | 23433321130013303123 |
6 | 305101451303554125 |
7 | 14131346011454210 |
oct | 1406265252162205 |
9 | 228363538313428 |
10 | 53213213025413 |
11 | 15a5666253a581 |
12 | 5b750b145b945 |
13 | 238cca4b0b97c |
14 | d1d767360777 |
15 | 6242e78086c8 |
hex | 3065aaa8e485 |
53213213025413 has 4 divisors (see below), whose sum is σ = 60815100600480. Its totient is φ = 45611325450348.
The previous prime is 53213213025409. The next prime is 53213213025433. The reversal of 53213213025413 is 31452031231235.
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 53213213025413 - 22 = 53213213025409 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 (53213213025433) 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, 3800943787523 + ... + 3800943787536.
It is an arithmetic number, because the mean of its divisors is an integer number (15203775150120).
Almost surely, 253213213025413 is an apocalyptic number.
It is an amenable number.
53213213025413 is a deficient number, since it is larger than the sum of its proper divisors (7601887575067).
53213213025413 is an equidigital number, since it uses as much as digits as its factorization.
53213213025413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7601887575066.
The product of its (nonzero) digits is 64800, while the sum is 35.
Adding to 53213213025413 its reverse (31452031231235), we get a palindrome (84665244256648).
The spelling of 53213213025413 in words is "fifty-three trillion, two hundred thirteen billion, two hundred thirteen million, twenty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •