Base | Representation |
---|---|
bin | 10000000001011001011… |
… | …011110110010000000101 |
3 | 10220020220102111210001200 |
4 | 100001121123312100011 |
5 | 121014333044200401 |
6 | 2201444210213113 |
7 | 142355051302464 |
oct | 20013133662005 |
9 | 3806812453050 |
10 | 1101012100101 |
11 | 394a33699861 |
12 | 159472884199 |
13 | 7ca95690b84 |
14 | 3b409a849db |
15 | 1d98e772686 |
hex | 100596f6405 |
1101012100101 has 48 divisors (see below), whose sum is σ = 1729526722560. Its totient is φ = 672201815040.
The previous prime is 1101012100057. The next prime is 1101012100117. The reversal of 1101012100101 is 1010012101011.
It is not a de Polignac number, because 1101012100101 - 29 = 1101012099589 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101012100801) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2145916 + ... + 2609018.
It is an arithmetic number, because the mean of its divisors is an integer number (36031806720).
Almost surely, 21101012100101 is an apocalyptic number.
It is an amenable number.
1101012100101 is a deficient number, since it is larger than the sum of its proper divisors (628514622459).
1101012100101 is a wasteful number, since it uses less digits than its factorization.
1101012100101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 463546 (or 463543 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1101012100101 its reverse (1010012101011), we get a palindrome (2111024201112).
The spelling of 1101012100101 in words is "one trillion, one hundred one billion, twelve million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •