Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …101100000101000111010 |
3 | 10220021011022210121011001 |
4 | 100001133111200220322 |
5 | 121020033420231020 |
6 | 2201502104155214 |
7 | 142360362640003 |
oct | 20013725405072 |
9 | 3807138717131 |
10 | 1101111102010 |
11 | 394a84569417 |
12 | 15949ba68b0a |
13 | 7cab004529a |
14 | 3b418c961aa |
15 | 1d9982cb50a |
hex | 1005f560a3a |
1101111102010 has 32 divisors (see below), whose sum is σ = 2019508144272. Its totient is φ = 432110215680.
The previous prime is 1101111101999. The next prime is 1101111102023. The reversal of 1101111102010 is 102011111011.
It can be written as a sum of positive squares in 8 ways, for example, as 726502227201 + 374608874809 = 852351^2 + 612053^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
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, 11824030 + ... + 11916790.
Almost surely, 21101111102010 is an apocalyptic number.
1101111102010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1101111102010 is a deficient number, since it is larger than the sum of its proper divisors (918397042262).
1101111102010 is a wasteful number, since it uses less digits than its factorization.
1101111102010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115218.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 1101111102010 its reverse (102011111011), we get a palindrome (1203122213021).
Subtracting from 1101111102010 its reverse (102011111011), we obtain a palindrome (999099990999).
It can be divided in two parts, 110111 and 1102010, that added together give a palindrome (1212121).
The spelling of 1101111102010 in words is "one trillion, one hundred one billion, one hundred eleven million, one hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •