Base | Representation |
---|---|
bin | 1100010111110011… |
… | …1111110001110101 |
3 | 22120110020102200122 |
4 | 3011330333301311 |
5 | 23300200221204 |
6 | 1305314421325 |
7 | 145204616312 |
oct | 30574776165 |
9 | 8513212618 |
10 | 3321101429 |
11 | 1454747728 |
12 | 788291845 |
13 | 40c08cb99 |
14 | 23710dd09 |
15 | 1468700be |
hex | c5f3fc75 |
3321101429 has 2 divisors, whose sum is σ = 3321101430. Its totient is φ = 3321101428.
The previous prime is 3321101383. The next prime is 3321101473. The reversal of 3321101429 is 9241011233.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3065836900 + 255264529 = 55370^2 + 15977^2 .
It is a cyclic number.
It is not a de Polignac number, because 3321101429 - 224 = 3304324213 is a prime.
It is a super-2 number, since 2×33211014292 = 22059429403411684082, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3321101398 and 3321101407.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3321101479) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1660550714 + 1660550715.
It is an arithmetic number, because the mean of its divisors is an integer number (1660550715).
Almost surely, 23321101429 is an apocalyptic number.
It is an amenable number.
3321101429 is a deficient number, since it is larger than the sum of its proper divisors (1).
3321101429 is an equidigital number, since it uses as much as digits as its factorization.
3321101429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
The square root of 3321101429 is about 57628.9981606483. The cubic root of 3321101429 is about 1491.9721387953.
The spelling of 3321101429 in words is "three billion, three hundred twenty-one million, one hundred one thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •