Base | Representation |
---|---|
bin | 1010000001011100101100… |
… | …1011110111100001111001 |
3 | 1110000111112202011221201122 |
4 | 2200113023023313201321 |
5 | 2421022430000000441 |
6 | 35234303524555025 |
7 | 2215111605320510 |
oct | 240271313674171 |
9 | 43014482157648 |
10 | 11020000000121 |
11 | 3569612789032 |
12 | 129b8bb852a75 |
13 | 61c248acba58 |
14 | 2a152985b677 |
15 | 1419c742534b |
hex | a05cb2f7879 |
11020000000121 has 16 divisors (see below), whose sum is σ = 12809595156480. Its totient is φ = 9284278379280.
The previous prime is 11020000000109. The next prime is 11020000000129. The reversal of 11020000000121 is 12100000002011.
It is a cyclic number.
It is not a de Polignac number, because 11020000000121 - 210 = 11019999999097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11020000000099 and 11020000000108.
It is not an unprimeable number, because it can be changed into a prime (11020000000129) by changing a digit.
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, 948656 + ... + 4789566.
It is an arithmetic number, because the mean of its divisors is an integer number (800599697280).
Almost surely, 211020000000121 is an apocalyptic number.
It is an amenable number.
11020000000121 is a deficient number, since it is larger than the sum of its proper divisors (1789595156359).
11020000000121 is an equidigital number, since it uses as much as digits as its factorization.
11020000000121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3847924.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 11020000000121 its reverse (12100000002011), we get a palindrome (23120000002132).
The spelling of 11020000000121 in words is "eleven trillion, twenty billion, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •