Base | Representation |
---|---|
bin | 1010000001100101010001… |
… | …1001110000100001100000 |
3 | 1110000201111012000202120001 |
4 | 2200121110121300201200 |
5 | 2421042133320320112 |
6 | 35235324203225344 |
7 | 2215222631111410 |
oct | 240312431604140 |
9 | 43021435022501 |
10 | 11022302120032 |
11 | 356a594217875 |
12 | 12a0242818254 |
13 | 61c524a36a98 |
14 | 2a16a74bc640 |
15 | 141aae5b4c57 |
hex | a0654670860 |
11022302120032 has 24 divisors (see below), whose sum is σ = 24800179770576. Its totient is φ = 4723843765632.
The previous prime is 11022302120029. The next prime is 11022302120083. The reversal of 11022302120032 is 23002120322011.
It is a super-3 number, since 3×110223021200323 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 11022302119991 and 11022302120009.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24603352723 + ... + 24603353170.
It is an arithmetic number, because the mean of its divisors is an integer number (1033340823774).
Almost surely, 211022302120032 is an apocalyptic number.
It is an amenable number.
11022302120032 is an abundant number, since it is smaller than the sum of its proper divisors (13777877650544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11022302120032 is an equidigital number, since it uses as much as digits as its factorization.
11022302120032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49206705910 (or 49206705902 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 11022302120032 its reverse (23002120322011), we get a palindrome (34024422442043).
The spelling of 11022302120032 in words is "eleven trillion, twenty-two billion, three hundred two million, one hundred twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •