Base | Representation |
---|---|
bin | 110000000001101111110… |
… | …001111001100011110001 |
3 | 102200111221021010101222121 |
4 | 300001233301321203301 |
5 | 413033220010010441 |
6 | 11004104301234241 |
7 | 460306146060256 |
oct | 60015761714361 |
9 | 12614837111877 |
10 | 3300410235121 |
11 | 106277259976a |
12 | 453784862981 |
13 | 1ac2c564498c |
14 | b5a5270542d |
15 | 5acb7e38dd1 |
hex | 3006fc798f1 |
3300410235121 has 2 divisors, whose sum is σ = 3300410235122. Its totient is φ = 3300410235120.
The previous prime is 3300410235113. The next prime is 3300410235173. The reversal of 3300410235121 is 1215320140033.
It is a happy number.
3300410235121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3288075023025 + 12335212096 = 1813305^2 + 111064^2 .
It is a cyclic number.
It is not a de Polignac number, because 3300410235121 - 23 = 3300410235113 is a prime.
It is not a weakly prime, because it can be changed into another prime (3300410235821) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1650205117560 + 1650205117561.
It is an arithmetic number, because the mean of its divisors is an integer number (1650205117561).
Almost surely, 23300410235121 is an apocalyptic number.
It is an amenable number.
3300410235121 is a deficient number, since it is larger than the sum of its proper divisors (1).
3300410235121 is an equidigital number, since it uses as much as digits as its factorization.
3300410235121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 3300410235121 its reverse (1215320140033), we get a palindrome (4515730375154).
The spelling of 3300410235121 in words is "three trillion, three hundred billion, four hundred ten million, two hundred thirty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •