Base | Representation |
---|---|
bin | 1011111111111111… |
… | …1010000011100001 |
3 | 22022111020222020020 |
4 | 2333333322003201 |
5 | 23044111413441 |
6 | 1251345304053 |
7 | 142552520625 |
oct | 27777720341 |
9 | 8274228206 |
10 | 3221201121 |
11 | 1403314096 |
12 | 75a935029 |
13 | 3c4482888 |
14 | 227b47185 |
15 | 13cbd9e66 |
hex | bfffa0e1 |
3221201121 has 24 divisors (see below), whose sum is σ = 4420363392. Its totient is φ = 2086473600.
The previous prime is 3221201117. The next prime is 3221201171. The reversal of 3221201121 is 1211021223.
It is not a de Polignac number, because 3221201121 - 22 = 3221201117 is a prime.
It is a super-2 number, since 2×32212011212 = 20752273323863313282, which contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 3221201121.
It is not an unprimeable number, because it can be changed into a prime (3221201171) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1365475 + ... + 1367831.
It is an arithmetic number, because the mean of its divisors is an integer number (184181808).
Almost surely, 23221201121 is an apocalyptic number.
It is an amenable number.
3221201121 is a deficient number, since it is larger than the sum of its proper divisors (1199162271).
3221201121 is a wasteful number, since it uses less digits than its factorization.
3221201121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2713 (or 2672 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 3221201121 is about 56755.6263378354. The cubic root of 3221201121 is about 1476.8598385131.
Adding to 3221201121 its reverse (1211021223), we get a palindrome (4432222344).
The spelling of 3221201121 in words is "three billion, two hundred twenty-one million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •