Base | Representation |
---|---|
bin | 1100010111100011… |
… | …0101010110100101 |
3 | 22120101011222201212 |
4 | 3011320311112211 |
5 | 23244410311044 |
6 | 1305235201205 |
7 | 145162422611 |
oct | 30570652645 |
9 | 8511158655 |
10 | 3320010149 |
11 | 1454071845 |
12 | 787a46205 |
13 | 40ba9a261 |
14 | 236d08341 |
15 | 146706a9e |
hex | c5e355a5 |
3320010149 has 2 divisors, whose sum is σ = 3320010150. Its totient is φ = 3320010148.
The previous prime is 3320010107. The next prime is 3320010151. The reversal of 3320010149 is 9410100233.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3279280225 + 40729924 = 57265^2 + 6382^2 .
It is a cyclic number.
It is not a de Polignac number, because 3320010149 - 28 = 3320009893 is a prime.
It is a super-2 number, since 2×33200101492 = 22044934778926004402, which contains 22 as substring.
Together with 3320010151, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3320012149) 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, 1660005074 + 1660005075.
It is an arithmetic number, because the mean of its divisors is an integer number (1660005075).
Almost surely, 23320010149 is an apocalyptic number.
It is an amenable number.
3320010149 is a deficient number, since it is larger than the sum of its proper divisors (1).
3320010149 is an equidigital number, since it uses as much as digits as its factorization.
3320010149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
The square root of 3320010149 is about 57619.5292327176. The cubic root of 3320010149 is about 1491.8087052924.
The spelling of 3320010149 in words is "three billion, three hundred twenty million, ten thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •