Base | Representation |
---|---|
bin | 100110100110000110011… |
… | …0110000100011010101101 |
3 | 200210002211201210110221212 |
4 | 1031030030312010122231 |
5 | 1143402104012023041 |
6 | 15140504222404205 |
7 | 1055144312666636 |
oct | 115141466043255 |
9 | 20702751713855 |
10 | 5304500111021 |
11 | 176569802a881 |
12 | 71806a430665 |
13 | 2c629b308057 |
14 | 144a4c42288d |
15 | 92eaeee18eb |
hex | 4d30cd846ad |
5304500111021 has 4 divisors (see below), whose sum is σ = 5325140189532. Its totient is φ = 5283860032512.
The previous prime is 5304500110891. The next prime is 5304500111033. The reversal of 5304500111021 is 1201110054035.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4880184664996 + 424315446025 = 2209114^2 + 651395^2 .
It is a cyclic number.
It is not a de Polignac number, because 5304500111021 - 234 = 5287320241837 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 (5304500111041) 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, 10320038870 + ... + 10320039383.
It is an arithmetic number, because the mean of its divisors is an integer number (1331285047383).
Almost surely, 25304500111021 is an apocalyptic number.
It is an amenable number.
5304500111021 is a deficient number, since it is larger than the sum of its proper divisors (20640078511).
5304500111021 is a wasteful number, since it uses less digits than its factorization.
5304500111021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20640078510.
The product of its (nonzero) digits is 600, while the sum is 23.
Adding to 5304500111021 its reverse (1201110054035), we get a palindrome (6505610165056).
The spelling of 5304500111021 in words is "five trillion, three hundred four billion, five hundred million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •