Base | Representation |
---|---|
bin | 100110100110000111011… |
… | …0100110100111111000101 |
3 | 200210002221001022200200112 |
4 | 1031030032310310333011 |
5 | 1143402141013340401 |
6 | 15140511410522405 |
7 | 1055145165304502 |
oct | 115141664647705 |
9 | 20702831280615 |
10 | 5304533340101 |
11 | 1765704866326 |
12 | 718079596405 |
13 | 2c62a5170a28 |
14 | 144a529d24a9 |
15 | 92eb2da73bb |
hex | 4d30ed34fc5 |
5304533340101 has 2 divisors, whose sum is σ = 5304533340102. Its totient is φ = 5304533340100.
The previous prime is 5304533340079. The next prime is 5304533340109. The reversal of 5304533340101 is 1010433354035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5206948951876 + 97584388225 = 2281874^2 + 312385^2 .
It is a cyclic number.
It is not a de Polignac number, because 5304533340101 - 230 = 5303459598277 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5304533340109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2652266670050 + 2652266670051.
It is an arithmetic number, because the mean of its divisors is an integer number (2652266670051).
Almost surely, 25304533340101 is an apocalyptic number.
It is an amenable number.
5304533340101 is a deficient number, since it is larger than the sum of its proper divisors (1).
5304533340101 is an equidigital number, since it uses as much as digits as its factorization.
5304533340101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 32.
Adding to 5304533340101 its reverse (1010433354035), we get a palindrome (6314966694136).
The spelling of 5304533340101 in words is "five trillion, three hundred four billion, five hundred thirty-three million, three hundred forty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •