Base | Representation |
---|---|
bin | 110000001010110111100… |
… | …011101011011001000101 |
3 | 102201110012211120121002012 |
4 | 300022313203223121011 |
5 | 413213244311314341 |
6 | 11012404212224005 |
7 | 461103644106344 |
oct | 60126743533105 |
9 | 12643184517065 |
10 | 3310204401221 |
11 | 10669390a6713 |
12 | 45565890b005 |
13 | 1b01c67b4633 |
14 | b63013a7b5b |
15 | 5b18cbd90eb |
hex | 302b78eb645 |
3310204401221 has 2 divisors, whose sum is σ = 3310204401222. Its totient is φ = 3310204401220.
The previous prime is 3310204401199. The next prime is 3310204401241. The reversal of 3310204401221 is 1221044020133.
3310204401221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2090008010596 + 1220196390625 = 1445686^2 + 1104625^2 .
It is a cyclic number.
It is not a de Polignac number, because 3310204401221 - 222 = 3310200206917 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3310204401241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1655102200610 + 1655102200611.
It is an arithmetic number, because the mean of its divisors is an integer number (1655102200611).
Almost surely, 23310204401221 is an apocalyptic number.
It is an amenable number.
3310204401221 is a deficient number, since it is larger than the sum of its proper divisors (1).
3310204401221 is an equidigital number, since it uses as much as digits as its factorization.
3310204401221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 3310204401221 its reverse (1221044020133), we get a palindrome (4531248421354).
The spelling of 3310204401221 in words is "three trillion, three hundred ten billion, two hundred four million, four hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •