Base | Representation |
---|---|
bin | 1011111111101110… |
… | …1101011110010101 |
3 | 22022102012002011111 |
4 | 2333323231132111 |
5 | 23043321213023 |
6 | 1251305535021 |
7 | 142540256413 |
oct | 27773553625 |
9 | 8272162144 |
10 | 3220101013 |
11 | 1402732608 |
12 | 75a4a4471 |
13 | 3c4188c1c |
14 | 22793c2b3 |
15 | 13ca6e00d |
hex | bfeed795 |
3220101013 has 2 divisors, whose sum is σ = 3220101014. Its totient is φ = 3220101012.
The previous prime is 3220100963. The next prime is 3220101047. The reversal of 3220101013 is 3101010223.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2045119729 + 1174981284 = 45223^2 + 34278^2 .
It is a cyclic number.
It is not a de Polignac number, because 3220101013 - 221 = 3218003861 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3220100984 and 3220101002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3220101413) 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, 1610050506 + 1610050507.
It is an arithmetic number, because the mean of its divisors is an integer number (1610050507).
Almost surely, 23220101013 is an apocalyptic number.
It is an amenable number.
3220101013 is a deficient number, since it is larger than the sum of its proper divisors (1).
3220101013 is an equidigital number, since it uses as much as digits as its factorization.
3220101013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 3220101013 is about 56745.9338895749. The cubic root of 3220101013 is about 1476.6916931273.
Adding to 3220101013 its reverse (3101010223), we get a palindrome (6321111236).
The spelling of 3220101013 in words is "three billion, two hundred twenty million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •