Base | Representation |
---|---|
bin | 1010000000010011000001… |
… | …0000111110100100101110 |
3 | 1102221121111022111202002210 |
4 | 2200010300100332210232 |
5 | 2420211423034031110 |
6 | 35221233132231250 |
7 | 2213511505522161 |
oct | 240046020764456 |
9 | 42847438452083 |
10 | 11000221002030 |
11 | 3561192a87017 |
12 | 1297abb90b526 |
13 | 61a4161528a0 |
14 | 2a05b0a63ad8 |
15 | 14121acb1520 |
hex | a013043e92e |
11000221002030 has 64 divisors (see below), whose sum is σ = 28431680578560. Its totient is φ = 2707714313856.
The previous prime is 11000221001993. The next prime is 11000221002041. The reversal of 11000221002030 is 3020012200011.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11000221001997 and 11000221002015.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 59407131 + ... + 59592009.
It is an arithmetic number, because the mean of its divisors is an integer number (444245009040).
Almost surely, 211000221002030 is an apocalyptic number.
11000221002030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11000221002030 is an abundant number, since it is smaller than the sum of its proper divisors (17431459576530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000221002030 is a wasteful number, since it uses less digits than its factorization.
11000221002030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337465.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 11000221002030 its reverse (3020012200011), we get a palindrome (14020233202041).
The spelling of 11000221002030 in words is "eleven trillion, two hundred twenty-one million, two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •