Base | Representation |
---|---|
bin | 1010000001100100010000… |
… | …1100111000101110100100 |
3 | 1110000200210020120101201020 |
4 | 2200121010030320232210 |
5 | 2421041104224412213 |
6 | 35235241213331140 |
7 | 2215213120552263 |
oct | 240310414705644 |
9 | 43020706511636 |
10 | 11022030310308 |
11 | 356a464848136 |
12 | 12a0187796ab0 |
13 | 61c4b0629324 |
14 | 2a167d3665da |
15 | 141a957c3923 |
hex | a0644338ba4 |
11022030310308 has 24 divisors (see below), whose sum is σ = 25753156789248. Its totient is φ = 3668997808416.
The previous prime is 11022030310307. The next prime is 11022030310331. The reversal of 11022030310308 is 80301303022011.
It is a super-2 number, since 2×110220303103082 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11022030310307) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 626527716 + ... + 626545307.
It is an arithmetic number, because the mean of its divisors is an integer number (1073048199552).
Almost surely, 211022030310308 is an apocalyptic number.
It is an amenable number.
11022030310308 is an abundant number, since it is smaller than the sum of its proper divisors (14731126478940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11022030310308 is a wasteful number, since it uses less digits than its factorization.
11022030310308 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1253073763 (or 1253073761 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 11022030310308 its reverse (80301303022011), we get a palindrome (91323333332319).
The spelling of 11022030310308 in words is "eleven trillion, twenty-two billion, thirty million, three hundred ten thousand, three hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •