Base | Representation |
---|---|
bin | 1110111011010000… |
… | …10100000111111101 |
3 | 202200110102211101002 |
4 | 13131220110013331 |
5 | 112402401101341 |
6 | 3403052500045 |
7 | 402401633213 |
oct | 73550240775 |
9 | 22613384332 |
10 | 8013300221 |
11 | 3442332073 |
12 | 167777a625 |
13 | 9a921bb84 |
14 | 56036acb3 |
15 | 31d77629b |
hex | 1dda141fd |
8013300221 has 2 divisors, whose sum is σ = 8013300222. Its totient is φ = 8013300220.
The previous prime is 8013300199. The next prime is 8013300233. The reversal of 8013300221 is 1220033108.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7941304996 + 71995225 = 89114^2 + 8485^2 .
It is a cyclic number.
It is not a de Polignac number, because 8013300221 - 26 = 8013300157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 8013300193 and 8013300202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8013302221) 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, 4006650110 + 4006650111.
It is an arithmetic number, because the mean of its divisors is an integer number (4006650111).
Almost surely, 28013300221 is an apocalyptic number.
It is an amenable number.
8013300221 is a deficient number, since it is larger than the sum of its proper divisors (1).
8013300221 is an equidigital number, since it uses as much as digits as its factorization.
8013300221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 8013300221 is about 89517.0387188942. The cubic root of 8013300221 is about 2001.1077380949.
Adding to 8013300221 its reverse (1220033108), we get a palindrome (9233333329).
The spelling of 8013300221 in words is "eight billion, thirteen million, three hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •