Base | Representation |
---|---|
bin | 1010000010000011000111… |
… | …0001010010100111011110 |
3 | 1110001111011100012002022122 |
4 | 2200200301301102213132 |
5 | 2421210034110133042 |
6 | 35243131021542542 |
7 | 2215625250463106 |
oct | 240406161224736 |
9 | 43044140162278 |
10 | 11030311021022 |
11 | 3572a24014707 |
12 | 12a18b8a14a52 |
13 | 620200075457 |
14 | 2a1c27022206 |
15 | 141dcc76c7d2 |
hex | a0831c529de |
11030311021022 has 32 divisors (see below), whose sum is σ = 17933582456064. Its totient is φ = 5067915350400.
The previous prime is 11030311021013. The next prime is 11030311021117. The reversal of 11030311021022 is 22012011303011.
It is a super-2 number, since 2×110303110210222 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1960247 + ... + 5089517.
It is an arithmetic number, because the mean of its divisors is an integer number (560424451752).
Almost surely, 211030311021022 is an apocalyptic number.
11030311021022 is a deficient number, since it is larger than the sum of its proper divisors (6903271435042).
11030311021022 is a wasteful number, since it uses less digits than its factorization.
11030311021022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3131744.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11030311021022 its reverse (22012011303011), we get a palindrome (33042322324033).
The spelling of 11030311021022 in words is "eleven trillion, thirty billion, three hundred eleven million, twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •