Base | Representation |
---|---|
bin | 1010000001100100111110… |
… | …0100010011110101000001 |
3 | 1110000201021112101102210110 |
4 | 2200121033210103311001 |
5 | 2421042002034000001 |
6 | 35235312144421533 |
7 | 2215220624442021 |
oct | 240311744236501 |
9 | 43021245342713 |
10 | 11022221000001 |
11 | 356a552451122 |
12 | 12a021b6178a9 |
13 | 61c510ca3973 |
14 | 2a169a803a81 |
15 | 141aa73de3d6 |
hex | a064f913d41 |
11022221000001 has 16 divisors (see below), whose sum is σ = 14937565898880. Its totient is φ = 7227517336320.
The previous prime is 11022220999967. The next prime is 11022221000047. The reversal of 11022221000001 is 10000012222011.
It is not a de Polignac number, because 11022221000001 - 229 = 11021684129089 is a prime.
It is a super-5 number, since 5×110222210000015 (a number of 66 digits) contains 55555 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11022221000051) by changing a digit.
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, 7421740 + ... + 8782178.
It is an arithmetic number, because the mean of its divisors is an integer number (933597868680).
Almost surely, 211022221000001 is an apocalyptic number.
It is an amenable number.
11022221000001 is a deficient number, since it is larger than the sum of its proper divisors (3915344898879).
11022221000001 is a wasteful number, since it uses less digits than its factorization.
11022221000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1404776.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11022221000001 its reverse (10000012222011), we get a palindrome (21022233222012).
The spelling of 11022221000001 in words is "eleven trillion, twenty-two billion, two hundred twenty-one million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •