Base | Representation |
---|---|
bin | 1010000001100101010001… |
… | …1001110000100001100001 |
3 | 1110000201111012000202120002 |
4 | 2200121110121300201201 |
5 | 2421042133320320113 |
6 | 35235324203225345 |
7 | 2215222631111411 |
oct | 240312431604141 |
9 | 43021435022502 |
10 | 11022302120033 |
11 | 356a594217876 |
12 | 12a0242818255 |
13 | 61c524a36a99 |
14 | 2a16a74bc641 |
15 | 141aae5b4c58 |
hex | a0654670861 |
11022302120033 has 16 divisors (see below), whose sum is σ = 11109800070144. Its totient is φ = 10935123978240.
The previous prime is 11022302120029. The next prime is 11022302120083. The reversal of 11022302120033 is 33002120322011.
It is a cyclic number.
It is not a de Polignac number, because 11022302120033 - 22 = 11022302120029 is a prime.
It is a super-2 number, since 2×110223021200332 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11022302119987 and 11022302120014.
It is not an unprimeable number, because it can be changed into a prime (11022302120083) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 747419366 + ... + 747434112.
It is an arithmetic number, because the mean of its divisors is an integer number (694362504384).
Almost surely, 211022302120033 is an apocalyptic number.
It is an amenable number.
11022302120033 is a deficient number, since it is larger than the sum of its proper divisors (87497950111).
11022302120033 is a wasteful number, since it uses less digits than its factorization.
11022302120033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25192.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 11022302120033 its reverse (33002120322011), we get a palindrome (44024422442044).
The spelling of 11022302120033 in words is "eleven trillion, twenty-two billion, three hundred two million, one hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •