Base | Representation |
---|---|
bin | 100110100110000110011… |
… | …0110000010010001000101 |
3 | 200210002211201210000212122 |
4 | 1031030030312002101011 |
5 | 1143402104011232323 |
6 | 15140504222255325 |
7 | 1055144312632154 |
oct | 115141466022105 |
9 | 20702751700778 |
10 | 5304500102213 |
11 | 17656980241a4 |
12 | 71806a427545 |
13 | 2c629b304040 |
14 | 144a4c41d59b |
15 | 92eaeeddec8 |
hex | 4d30cd82445 |
5304500102213 has 8 divisors (see below), whose sum is σ = 5896814009856. Its totient is φ = 4738511257200.
The previous prime is 5304500102201. The next prime is 5304500102227. The reversal of 5304500102213 is 3122010054035.
It is a happy number.
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 5304500102213 - 24 = 5304500102197 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 (5304500102513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6581265233 + ... + 6581266038.
It is an arithmetic number, because the mean of its divisors is an integer number (737101751232).
Almost surely, 25304500102213 is an apocalyptic number.
It is an amenable number.
5304500102213 is a deficient number, since it is larger than the sum of its proper divisors (592313907643).
5304500102213 is a wasteful number, since it uses less digits than its factorization.
5304500102213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13162531315.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 5304500102213 its reverse (3122010054035), we get a palindrome (8426510156248).
The spelling of 5304500102213 in words is "five trillion, three hundred four billion, five hundred million, one hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •