Base | Representation |
---|---|
bin | 100110100110000010000… |
… | …0001111000010101001101 |
3 | 200210002110102111110001111 |
4 | 1031030010001320111031 |
5 | 1143401303131243201 |
6 | 15140441420412021 |
7 | 1055140535611222 |
oct | 115140401702515 |
9 | 20702412443044 |
10 | 5304352212301 |
11 | 17656215a332a |
12 | 7180289a7011 |
13 | 2c627679370c |
14 | 144a36923949 |
15 | 92ea2029b51 |
hex | 4d30407854d |
5304352212301 has 2 divisors, whose sum is σ = 5304352212302. Its totient is φ = 5304352212300.
The previous prime is 5304352212293. The next prime is 5304352212347. The reversal of 5304352212301 is 1032122534035.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4675779146025 + 628573066276 = 2162355^2 + 792826^2 .
It is a cyclic number.
It is not a de Polignac number, because 5304352212301 - 23 = 5304352212293 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5304352216301) 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 as a sum of consecutive naturals, namely, 2652176106150 + 2652176106151.
It is an arithmetic number, because the mean of its divisors is an integer number (2652176106151).
Almost surely, 25304352212301 is an apocalyptic number.
It is an amenable number.
5304352212301 is a deficient number, since it is larger than the sum of its proper divisors (1).
5304352212301 is an equidigital number, since it uses as much as digits as its factorization.
5304352212301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 5304352212301 its reverse (1032122534035), we get a palindrome (6336474746336).
The spelling of 5304352212301 in words is "five trillion, three hundred four billion, three hundred fifty-two million, two hundred twelve thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •