Base | Representation |
---|---|
bin | 111011110110010000001… |
… | …0010010000000110100001 |
3 | 1002010100012112211101102121 |
4 | 1313230200102100012201 |
5 | 2034231111412333142 |
6 | 25254410510344241 |
7 | 1506160115431612 |
oct | 167544022200641 |
9 | 32110175741377 |
10 | 8225404027297 |
11 | 2691413157116 |
12 | b0a17b1bb081 |
13 | 47886306b242 |
14 | 20617c639c09 |
15 | e3e657b8c67 |
hex | 77b204901a1 |
8225404027297 has 2 divisors, whose sum is σ = 8225404027298. Its totient is φ = 8225404027296.
The previous prime is 8225404027283. The next prime is 8225404027301. The reversal of 8225404027297 is 7927204045228.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7249103917056 + 976300110241 = 2692416^2 + 988079^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-8225404027297 is a prime.
It is a super-2 number, since 2×82254040272972 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (8225404067297) 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, 4112702013648 + 4112702013649.
It is an arithmetic number, because the mean of its divisors is an integer number (4112702013649).
Almost surely, 28225404027297 is an apocalyptic number.
It is an amenable number.
8225404027297 is a deficient number, since it is larger than the sum of its proper divisors (1).
8225404027297 is an equidigital number, since it uses as much as digits as its factorization.
8225404027297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4515840, while the sum is 52.
The spelling of 8225404027297 in words is "eight trillion, two hundred twenty-five billion, four hundred four million, twenty-seven thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •