Base | Representation |
---|---|
bin | 1010000001011100101111… |
… | …0110010010010111111010 |
3 | 1110000111120112002220111112 |
4 | 2200113023312102113322 |
5 | 2421022440321320442 |
6 | 35234305003200322 |
7 | 2215112101663364 |
oct | 240271366222772 |
9 | 43014515086445 |
10 | 11020011120122 |
11 | 3569618a93714 |
12 | 129b9035160a2 |
13 | 61c24b1c3334 |
14 | 2a152b113d34 |
15 | 1419c83c0082 |
hex | a05cbd925fa |
11020011120122 has 8 divisors (see below), whose sum is σ = 16801000560372. Its totient is φ = 5419677600000.
The previous prime is 11020011120077. The next prime is 11020011120143. The reversal of 11020011120122 is 22102111002011.
It can be written as a sum of positive squares in 2 ways, for example, as 8220543388201 + 2799467731921 = 2867149^2 + 1673161^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×110200111201222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11020011120097 and 11020011120106.
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 3 ways as a sum of consecutive naturals, for example, 45163979879 + ... + 45163980122.
Almost surely, 211020011120122 is an apocalyptic number.
11020011120122 is a deficient number, since it is larger than the sum of its proper divisors (5780989440250).
11020011120122 is an equidigital number, since it uses as much as digits as its factorization.
11020011120122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90327960064.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11020011120122 its reverse (22102111002011), we get a palindrome (33122122122133).
The spelling of 11020011120122 in words is "eleven trillion, twenty billion, eleven million, one hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •