Base | Representation |
---|---|
bin | 1010000001011100101111… |
… | …0010000001001001111010 |
3 | 1110000111120110000001101020 |
4 | 2200113023302001021322 |
5 | 2421022440030013033 |
6 | 35234304523203310 |
7 | 2215112056322604 |
oct | 240271362011172 |
9 | 43014513001336 |
10 | 11020010001018 |
11 | 3569618399937 |
12 | 129b903076536 |
13 | 61c24abc0b45 |
14 | 2a152ad02174 |
15 | 1419c824d6b3 |
hex | a05cbc8127a |
11020010001018 has 16 divisors (see below), whose sum is σ = 22508956598400. Its totient is φ = 3595180567616.
The previous prime is 11020010001001. The next prime is 11020010001019. The reversal of 11020010001018 is 81010001002011.
It is a super-2 number, since 2×110200100010182 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11020010000988 and 11020010001006.
It is not an unprimeable number, because it can be changed into a prime (11020010001019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19539024543 + ... + 19539025106.
It is an arithmetic number, because the mean of its divisors is an integer number (1406809787400).
Almost surely, 211020010001018 is an apocalyptic number.
11020010001018 is an abundant number, since it is smaller than the sum of its proper divisors (11488946597382).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020010001018 is a wasteful number, since it uses less digits than its factorization.
11020010001018 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39078049701.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11020010001018 its reverse (81010001002011), we get a palindrome (92030011003029).
The spelling of 11020010001018 in words is "eleven trillion, twenty billion, ten million, one thousand, eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •