Base | Representation |
---|---|
bin | 100110100101111000001… |
… | …0010100001010101010011 |
3 | 200210001121100022122122202 |
4 | 1031023300102201111103 |
5 | 1143400113340431402 |
6 | 15140344510153415 |
7 | 1055126404610633 |
oct | 115136022412523 |
9 | 20701540278582 |
10 | 5304021030227 |
11 | 1765471661337 |
12 | 717b55ab286b |
13 | 2c6222c988aa |
14 | 144a049546c3 |
15 | 92e82e0bb02 |
hex | 4d2f04a1553 |
5304021030227 has 2 divisors, whose sum is σ = 5304021030228. Its totient is φ = 5304021030226.
The previous prime is 5304021030221. The next prime is 5304021030293. The reversal of 5304021030227 is 7220301204035.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5304021030227 - 240 = 4204509402451 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5304021030227.
It is not a weakly prime, because it can be changed into another prime (5304021030221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2652010515113 + 2652010515114.
It is an arithmetic number, because the mean of its divisors is an integer number (2652010515114).
Almost surely, 25304021030227 is an apocalyptic number.
5304021030227 is a deficient number, since it is larger than the sum of its proper divisors (1).
5304021030227 is an equidigital number, since it uses as much as digits as its factorization.
5304021030227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10080, while the sum is 29.
The spelling of 5304021030227 in words is "five trillion, three hundred four billion, twenty-one million, thirty thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •