Base | Representation |
---|---|
bin | 1100010111110101… |
… | …1000000110000101 |
3 | 22120110102111022112 |
4 | 3011331120012011 |
5 | 23300211413104 |
6 | 1305320510405 |
7 | 145205512556 |
oct | 30575300605 |
9 | 8513374275 |
10 | 3321201029 |
11 | 1454805543 |
12 | 78831b405 |
13 | 40c0c6313 |
14 | 23713832d |
15 | 14688e86e |
hex | c5f58185 |
3321201029 has 2 divisors, whose sum is σ = 3321201030. Its totient is φ = 3321201028.
The previous prime is 3321201011. The next prime is 3321201031. The reversal of 3321201029 is 9201021233.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3246378529 + 74822500 = 56977^2 + 8650^2 .
It is a cyclic number.
It is not a de Polignac number, because 3321201029 - 224 = 3304423813 is a prime.
It is a super-2 number, since 2×33212010292 = 22060752550061317682, which contains 22 as substring.
Together with 3321201031, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 3321200995 and 3321201013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3321201049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1660600514 + 1660600515.
It is an arithmetic number, because the mean of its divisors is an integer number (1660600515).
Almost surely, 23321201029 is an apocalyptic number.
It is an amenable number.
3321201029 is a deficient number, since it is larger than the sum of its proper divisors (1).
3321201029 is an equidigital number, since it uses as much as digits as its factorization.
3321201029 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 3321201029 is about 57629.8623024557. The cubic root of 3321201029 is about 1491.9870534195.
The spelling of 3321201029 in words is "three billion, three hundred twenty-one million, two hundred one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •