Base | Representation |
---|---|
bin | 10000000010100001011… |
… | …100000000001000000101 |
3 | 10220101000121120112112102 |
4 | 100002201130000020011 |
5 | 121024321321200401 |
6 | 2202204122001445 |
7 | 142430020160411 |
oct | 20024134001005 |
9 | 3811017515472 |
10 | 1102220100101 |
11 | 3954a356a06a |
12 | 15974b346285 |
13 | 7cc28a26783 |
14 | 3b4c2297d41 |
15 | 1da1083d56b |
hex | 100a1700205 |
1102220100101 has 4 divisors (see below), whose sum is σ = 1102223268972. Its totient is φ = 1102216931232.
The previous prime is 1102220099951. The next prime is 1102220100103. The reversal of 1102220100101 is 1010010222011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 467481243076 + 634738857025 = 683726^2 + 796705^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1102220100101 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102220100103) 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, 987806 + ... + 1783311.
It is an arithmetic number, because the mean of its divisors is an integer number (275555817243).
Almost surely, 21102220100101 is an apocalyptic number.
It is an amenable number.
1102220100101 is a deficient number, since it is larger than the sum of its proper divisors (3168871).
1102220100101 is an equidigital number, since it uses as much as digits as its factorization.
1102220100101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3168870.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1102220100101 its reverse (1010010222011), we get a palindrome (2112230322112).
The spelling of 1102220100101 in words is "one trillion, one hundred two billion, two hundred twenty million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •