Base | Representation |
---|---|
bin | 10010011000011… |
… | …101100000101101 |
3 | 210111022110022111 |
4 | 102120131200231 |
5 | 1112422332341 |
6 | 50334044021 |
7 | 10433242561 |
oct | 2230354055 |
9 | 714273274 |
10 | 308402221 |
11 | 1490a3176 |
12 | 87349611 |
13 | 4bb8032a |
14 | 2cd5d6a1 |
15 | 1c11d681 |
hex | 1261d82d |
308402221 has 2 divisors, whose sum is σ = 308402222. Its totient is φ = 308402220.
The previous prime is 308402209. The next prime is 308402261. The reversal of 308402221 is 122204803.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 255680100 + 52722121 = 15990^2 + 7261^2 .
It is a cyclic number.
It is not a de Polignac number, because 308402221 - 25 = 308402189 is a prime.
It is a super-2 number, since 2×3084022212 = 190223859835465682, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 308402192 and 308402201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (308402201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 154201110 + 154201111.
It is an arithmetic number, because the mean of its divisors is an integer number (154201111).
Almost surely, 2308402221 is an apocalyptic number.
It is an amenable number.
308402221 is a deficient number, since it is larger than the sum of its proper divisors (1).
308402221 is an equidigital number, since it uses as much as digits as its factorization.
308402221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 308402221 is about 17561.3843702597. The cubic root of 308402221 is about 675.6251883042.
The spelling of 308402221 in words is "three hundred eight million, four hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •