Base | Representation |
---|---|
bin | 1110111010010010… |
… | …11110000110011101 |
3 | 202122220020001000102 |
4 | 13131021132012131 |
5 | 112343313331441 |
6 | 3402203310445 |
7 | 402243126065 |
oct | 73511360635 |
9 | 22586201012 |
10 | 8005214621 |
11 | 343880a258 |
12 | 1674b1b425 |
13 | 9a764a7b1 |
14 | 55d2643a5 |
15 | 31cbca69b |
hex | 1dd25e19d |
8005214621 has 2 divisors, whose sum is σ = 8005214622. Its totient is φ = 8005214620.
The previous prime is 8005214603. The next prime is 8005214629. The reversal of 8005214621 is 1264125008.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7579617721 + 425596900 = 87061^2 + 20630^2 .
It is a cyclic number.
It is not a de Polignac number, because 8005214621 - 26 = 8005214557 is a prime.
It is a super-2 number, since 2×80052146212 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8005214629) 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, 4002607310 + 4002607311.
It is an arithmetic number, because the mean of its divisors is an integer number (4002607311).
Almost surely, 28005214621 is an apocalyptic number.
It is an amenable number.
8005214621 is a deficient number, since it is larger than the sum of its proper divisors (1).
8005214621 is an equidigital number, since it uses as much as digits as its factorization.
8005214621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3840, while the sum is 29.
The square root of 8005214621 is about 89471.8649688269. The cubic root of 8005214621 is about 2000.4344573666.
Adding to 8005214621 its reverse (1264125008), we get a palindrome (9269339629).
The spelling of 8005214621 in words is "eight billion, five million, two hundred fourteen thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •