Base | Representation |
---|---|
bin | 100011110011001… |
… | …0010110111101101 |
3 | 10002201022100120102 |
4 | 1013212102313231 |
5 | 4430003033401 |
6 | 315110200445 |
7 | 41524132223 |
oct | 10746226755 |
9 | 3081270512 |
10 | 1201221101 |
11 | 567070213 |
12 | 296353125 |
13 | 161b31222 |
14 | b576ab13 |
15 | 706cc56b |
hex | 47992ded |
1201221101 has 6 divisors (see below), whose sum is σ = 1206985806. Its totient is φ = 1195483800.
The previous prime is 1201221053. The next prime is 1201221107. The reversal of 1201221101 is 1011221021.
It can be written as a sum of positive squares in only one way, i.e., 799419076 + 401802025 = 28274^2 + 20045^2 .
It is a de Polignac number, because none of the positive numbers 2k-1201221101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201221107) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 31031 + ... + 58011.
It is an arithmetic number, because the mean of its divisors is an integer number (201164301).
Almost surely, 21201221101 is an apocalyptic number.
It is an amenable number.
1201221101 is a deficient number, since it is larger than the sum of its proper divisors (5764705).
1201221101 is an frugal number, since it uses more digits than its factorization.
1201221101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27403 (or 27192 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
The square root of 1201221101 is about 34658.6367446846. The cubic root of 1201221101 is about 1063.0188951678.
Adding to 1201221101 its reverse (1011221021), we get a palindrome (2212442122).
It can be divided in two parts, 120 and 1221101, that added together give a palindrome (1221221).
The spelling of 1201221101 in words is "one billion, two hundred one million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •