Base | Representation |
---|---|
bin | 10000000000101001101… |
… | …000111000010100110101 |
3 | 10220011211112121112210001 |
4 | 100000221220320110311 |
5 | 121011212303210401 |
6 | 2201232443031301 |
7 | 142326143324662 |
oct | 20005150702465 |
9 | 3804745545701 |
10 | 1100210210101 |
11 | 394661a87a52 |
12 | 15928a20b531 |
13 | 7c9984c8952 |
14 | 3b371386a69 |
15 | 1d944175601 |
hex | 10029a38535 |
1100210210101 has 4 divisors (see below), whose sum is σ = 1164928457772. Its totient is φ = 1035491962432.
The previous prime is 1100210210053. The next prime is 1100210210117. The reversal of 1100210210101 is 1010120120011.
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 557150280625 + 543059929476 = 746425^2 + 736926^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100210210101 - 217 = 1100210079029 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 (1100210210401) 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, 32359123810 + ... + 32359123843.
It is an arithmetic number, because the mean of its divisors is an integer number (291232114443).
Almost surely, 21100210210101 is an apocalyptic number.
It is an amenable number.
1100210210101 is a deficient number, since it is larger than the sum of its proper divisors (64718247671).
1100210210101 is an equidigital number, since it uses as much as digits as its factorization.
1100210210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64718247670.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1100210210101 its reverse (1010120120011), we get a palindrome (2110330330112).
The spelling of 1100210210101 in words is "one trillion, one hundred billion, two hundred ten million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •