Base | Representation |
---|---|
bin | 10000000001011001011… |
… | …100010001001000101101 |
3 | 10220020220102201101010012 |
4 | 100001121130101020231 |
5 | 121014333111211341 |
6 | 2201444212423005 |
7 | 142355052241520 |
oct | 20013134211055 |
9 | 3806812641105 |
10 | 1101012210221 |
11 | 394a33764570 |
12 | 159472917a65 |
13 | 7ca956cc031 |
14 | 3b409ab2bb7 |
15 | 1d98e7950eb |
hex | 1005971122d |
1101012210221 has 16 divisors (see below), whose sum is σ = 1393178472960. Its totient is φ = 845126639280.
The previous prime is 1101012210209. The next prime is 1101012210343. The reversal of 1101012210221 is 1220122101011.
It is not a de Polignac number, because 1101012210221 - 222 = 1101008015917 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101012210196 and 1101012210205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101012210421) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 106702751 + ... + 106713068.
It is an arithmetic number, because the mean of its divisors is an integer number (87073654560).
Almost surely, 21101012210221 is an apocalyptic number.
1101012210221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1101012210221 is a deficient number, since it is larger than the sum of its proper divisors (292166262739).
1101012210221 is a wasteful number, since it uses less digits than its factorization.
1101012210221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213415904.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1101012210221 its reverse (1220122101011), we get a palindrome (2321134311232).
The spelling of 1101012210221 in words is "one trillion, one hundred one billion, twelve million, two hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •