Base | Representation |
---|---|
bin | 10000000001011001111… |
… | …110100100011100011001 |
3 | 10220020221001122012210111 |
4 | 100001121332210130121 |
5 | 121014342411432301 |
6 | 2201445133244321 |
7 | 142355221542304 |
oct | 20013176443431 |
9 | 3806831565714 |
10 | 1101021202201 |
11 | 394a38846358 |
12 | 1594759336a1 |
13 | 7ca97529b2b |
14 | 3b40ad73b3b |
15 | 1d99046e551 |
hex | 10059fa4719 |
1101021202201 has 4 divisors (see below), whose sum is σ = 1101386871504. Its totient is φ = 1100655532900.
The previous prime is 1101021202199. The next prime is 1101021202217. The reversal of 1101021202201 is 1022021201011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1101021202201 - 21 = 1101021202199 is a prime.
It is a super-2 number, since 2×11010212022012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1101021502201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 182830135 + ... + 182836156.
It is an arithmetic number, because the mean of its divisors is an integer number (275346717876).
Almost surely, 21101021202201 is an apocalyptic number.
It is an amenable number.
1101021202201 is a deficient number, since it is larger than the sum of its proper divisors (365669303).
1101021202201 is an equidigital number, since it uses as much as digits as its factorization.
1101021202201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 365669302.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1101021202201 its reverse (1022021201011), we get a palindrome (2123042403212).
The spelling of 1101021202201 in words is "one trillion, one hundred one billion, twenty-one million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •