Base | Representation |
---|---|
bin | 100110100110000110100… |
… | …0101000000000001110111 |
3 | 200210002212000011100012201 |
4 | 1031030031011000001313 |
5 | 1143402111012301312 |
6 | 15140504442325331 |
7 | 1055144361161362 |
oct | 115141505000167 |
9 | 20702760140181 |
10 | 5304504025207 |
11 | 176569a263642 |
12 | 71806b7b9847 |
13 | 2c629c07883a |
14 | 144a4cb610d9 |
15 | 92eb0516557 |
hex | 4d30d140077 |
5304504025207 has 2 divisors, whose sum is σ = 5304504025208. Its totient is φ = 5304504025206.
The previous prime is 5304504025157. The next prime is 5304504025279. The reversal of 5304504025207 is 7025204054035.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5304504025207 - 215 = 5304503992439 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5304504025297) 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, 2652252012603 + 2652252012604.
It is an arithmetic number, because the mean of its divisors is an integer number (2652252012604).
Almost surely, 25304504025207 is an apocalyptic number.
5304504025207 is a deficient number, since it is larger than the sum of its proper divisors (1).
5304504025207 is an equidigital number, since it uses as much as digits as its factorization.
5304504025207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168000, while the sum is 37.
The spelling of 5304504025207 in words is "five trillion, three hundred four billion, five hundred four million, twenty-five thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •