Base | Representation |
---|---|
bin | 110000000010011000111… |
… | …101110000111001010101 |
3 | 102200120201102022122000000 |
4 | 300002120331300321111 |
5 | 413041123402224341 |
6 | 11004301023241513 |
7 | 460332236215662 |
oct | 60023075607125 |
9 | 12616642278000 |
10 | 3301101211221 |
11 | 1062a976352a0 |
12 | 453938149299 |
13 | 1ac3a5844888 |
14 | b5aba3b0a69 |
15 | 5ad089278b6 |
hex | 30098f70e55 |
3301101211221 has 112 divisors (see below), whose sum is σ = 5629546690560. Its totient is φ = 1916451653760.
The previous prime is 3301101211193. The next prime is 3301101211229. The reversal of 3301101211221 is 1221121011033.
3301101211221 is a `hidden beast` number, since 330 + 1 + 101 + 2 + 11 + 221 = 666.
It is not a de Polignac number, because 3301101211221 - 26 = 3301101211157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3301101211194 and 3301101211203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3301101211229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 29478091 + ... + 29589863.
Almost surely, 23301101211221 is an apocalyptic number.
It is an amenable number.
3301101211221 is a deficient number, since it is larger than the sum of its proper divisors (2328445479339).
3301101211221 is a wasteful number, since it uses less digits than its factorization.
3301101211221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111958 (or 111943 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 3301101211221 its reverse (1221121011033), we get a palindrome (4522222222254).
The spelling of 3301101211221 in words is "three trillion, three hundred one billion, one hundred one million, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •