Base | Representation |
---|---|
bin | 1010000001011100101101… |
… | …0111101100100110110110 |
3 | 1110000111112222000111111002 |
4 | 2200113023113230212312 |
5 | 2421022431243213420 |
6 | 35234304115243302 |
7 | 2215111643554343 |
oct | 240271327544666 |
9 | 43014488014432 |
10 | 11020003101110 |
11 | 3569614506933 |
12 | 129b9008a9532 |
13 | 61c249646363 |
14 | 2a152a0277ca |
15 | 1419c7839075 |
hex | a05cb5ec9b6 |
11020003101110 has 32 divisors (see below), whose sum is σ = 20059261035840. Its totient is φ = 4358519998848.
The previous prime is 11020003101097. The next prime is 11020003101137. The reversal of 11020003101110 is 1110130002011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11020003101091 and 11020003101100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7519625 + ... + 8864804.
It is an arithmetic number, because the mean of its divisors is an integer number (626851907370).
Almost surely, 211020003101110 is an apocalyptic number.
11020003101110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11020003101110 is a deficient number, since it is larger than the sum of its proper divisors (9039257934730).
11020003101110 is a wasteful number, since it uses less digits than its factorization.
11020003101110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16385192.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 11020003101110 its reverse (1110130002011), we get a palindrome (12130133103121).
The spelling of 11020003101110 in words is "eleven trillion, twenty billion, three million, one hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •