Base | Representation |
---|---|
bin | 1011111111101110… |
… | …1101011111101101 |
3 | 22022102012002021202 |
4 | 2333323231133231 |
5 | 23043321213401 |
6 | 1251305535245 |
7 | 142540256600 |
oct | 27773553755 |
9 | 8272162252 |
10 | 3220101101 |
11 | 1402732688 |
12 | 75a4a4525 |
13 | 3c4188c89 |
14 | 22793c337 |
15 | 13ca6e06b |
hex | bfeed7ed |
3220101101 has 24 divisors (see below), whose sum is σ = 3880557720. Its totient is φ = 2661090432.
The previous prime is 3220101097. The next prime is 3220101109. The reversal of 3220101101 is 1011010223.
It can be written as a sum of positive squares in 4 ways, for example, as 117722500 + 3102378601 = 10850^2 + 55699^2 .
It is not a de Polignac number, because 3220101101 - 22 = 3220101097 is a prime.
It is a super-2 number, since 2×32201011012 = 20738102201322824402, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3220101109) 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, 1438355 + ... + 1440591.
It is an arithmetic number, because the mean of its divisors is an integer number (161689905).
Almost surely, 23220101101 is an apocalyptic number.
It is an amenable number.
3220101101 is a deficient number, since it is larger than the sum of its proper divisors (660456619).
3220101101 is a wasteful number, since it uses less digits than its factorization.
3220101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3293 (or 3286 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 3220101101 is about 56745.9346649608. The cubic root of 3220101101 is about 1476.6917065791.
Adding to 3220101101 its reverse (1011010223), we get a palindrome (4231111324).
The spelling of 3220101101 in words is "three billion, two hundred twenty million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •