Base | Representation |
---|---|
bin | 1100010111100110… |
… | …0110111011010001 |
3 | 22120101120022021022 |
4 | 3011321212323101 |
5 | 23244433310301 |
6 | 1305243405225 |
7 | 145164226604 |
oct | 30571467321 |
9 | 8511508238 |
10 | 3320213201 |
11 | 14541a0358 |
12 | 787b23815 |
13 | 40bb3b7c6 |
14 | 236d5c33b |
15 | 146746d1b |
hex | c5e66ed1 |
3320213201 has 2 divisors, whose sum is σ = 3320213202. Its totient is φ = 3320213200.
The previous prime is 3320213177. The next prime is 3320213233. The reversal of 3320213201 is 1023120233.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2853696400 + 466516801 = 53420^2 + 21599^2 .
It is a cyclic number.
It is not a de Polignac number, because 3320213201 - 210 = 3320212177 is a prime.
It is a super-2 number, since 2×33202132012 = 22047631400189332802, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3320213201.
It is not a weakly prime, because it can be changed into another prime (3320213261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1660106600 + 1660106601.
It is an arithmetic number, because the mean of its divisors is an integer number (1660106601).
Almost surely, 23320213201 is an apocalyptic number.
It is an amenable number.
3320213201 is a deficient number, since it is larger than the sum of its proper divisors (1).
3320213201 is an equidigital number, since it uses as much as digits as its factorization.
3320213201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 3320213201 is about 57621.2912125371. The cubic root of 3320213201 is about 1491.8391177060.
Adding to 3320213201 its reverse (1023120233), we get a palindrome (4343333434).
The spelling of 3320213201 in words is "three billion, three hundred twenty million, two hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •