Base | Representation |
---|---|
bin | 1011111111101111… |
… | …0010110111110001 |
3 | 22022102020012111022 |
4 | 2333323302313301 |
5 | 23043322414441 |
6 | 1251310225225 |
7 | 142540411025 |
oct | 27773626761 |
9 | 8272205438 |
10 | 3220123121 |
11 | 1402748186 |
12 | 75a4b5215 |
13 | 3c4195cc7 |
14 | 227946385 |
15 | 13ca7584b |
hex | bfef2df1 |
3220123121 has 2 divisors, whose sum is σ = 3220123122. Its totient is φ = 3220123120.
The previous prime is 3220123099. The next prime is 3220123157. The reversal of 3220123121 is 1213210223.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3199146721 + 20976400 = 56561^2 + 4580^2 .
It is a cyclic number.
It is not a de Polignac number, because 3220123121 - 214 = 3220106737 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3220123121.
It is not a weakly prime, because it can be changed into another prime (3220120121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1610061560 + 1610061561.
It is an arithmetic number, because the mean of its divisors is an integer number (1610061561).
Almost surely, 23220123121 is an apocalyptic number.
It is an amenable number.
3220123121 is a deficient number, since it is larger than the sum of its proper divisors (1).
3220123121 is an equidigital number, since it uses as much as digits as its factorization.
3220123121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 3220123121 is about 56746.1286873387. The cubic root of 3220123121 is about 1476.6950725891.
Adding to 3220123121 its reverse (1213210223), we get a palindrome (4433333344).
The spelling of 3220123121 in words is "three billion, two hundred twenty million, one hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •