Base | Representation |
---|---|
bin | 10000000001011010000… |
… | …001111111101010000101 |
3 | 10220020221010022211111001 |
4 | 100001122001333222011 |
5 | 121014343124200401 |
6 | 2201445204413301 |
7 | 142355232302140 |
oct | 20013201775205 |
9 | 3806833284431 |
10 | 1101022100101 |
11 | 394a392a9a20 |
12 | 1594760a7231 |
13 | 7ca97782731 |
14 | 3b40b129057 |
15 | 1d99059a601 |
hex | 1005a07fa85 |
1101022100101 has 16 divisors (see below), whose sum is σ = 1378697235840. Its totient is φ = 854192825280.
The previous prime is 1101022100041. The next prime is 1101022100119. The reversal of 1101022100101 is 1010012201011.
It is a cyclic number.
It is not a de Polignac number, because 1101022100101 - 215 = 1101022067333 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 (1101022100401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31202866 + ... + 31238131.
It is an arithmetic number, because the mean of its divisors is an integer number (86168577240).
Almost surely, 21101022100101 is an apocalyptic number.
1101022100101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1101022100101 is a deficient number, since it is larger than the sum of its proper divisors (277675135739).
1101022100101 is a wasteful number, since it uses less digits than its factorization.
1101022100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62441244.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1101022100101 its reverse (1010012201011), we get a palindrome (2111034301112).
The spelling of 1101022100101 in words is "one trillion, one hundred one billion, twenty-two million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •