Base | Representation |
---|---|
bin | 1011111101100111… |
… | …0101010010010001 |
3 | 22021210110212212021 |
4 | 2333121311102101 |
5 | 23034033020423 |
6 | 1250351331441 |
7 | 142401630523 |
oct | 27731652221 |
9 | 8253425767 |
10 | 3211220113 |
11 | 13a8717222 |
12 | 757520b81 |
13 | 3c239985a |
14 | 2266a9a13 |
15 | 13bdb795d |
hex | bf675491 |
3211220113 has 2 divisors, whose sum is σ = 3211220114. Its totient is φ = 3211220112.
The previous prime is 3211220099. The next prime is 3211220119. The reversal of 3211220113 is 3110221123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2812499089 + 398721024 = 53033^2 + 19968^2 .
It is a cyclic number.
It is not a de Polignac number, because 3211220113 - 29 = 3211219601 is a prime.
It is a super-2 number, since 2×32112201132 = 20623869228271465538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3211220119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1605610056 + 1605610057.
It is an arithmetic number, because the mean of its divisors is an integer number (1605610057).
Almost surely, 23211220113 is an apocalyptic number.
It is an amenable number.
3211220113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3211220113 is an equidigital number, since it uses as much as digits as its factorization.
3211220113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 3211220113 is about 56667.6284398774. The cubic root of 3211220113 is about 1475.3328924786.
Adding to 3211220113 its reverse (3110221123), we get a palindrome (6321441236).
It can be divided in two parts, 32112 and 20113, that added together give a palindrome (52225).
The spelling of 3211220113 in words is "three billion, two hundred eleven million, two hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •