Base | Representation |
---|---|
bin | 10000000000011101001… |
… | …011010001011011100110 |
3 | 10220011021222011202212010 |
4 | 100000131023101123212 |
5 | 121010300241401042 |
6 | 2201200013335050 |
7 | 142321024156515 |
oct | 20003513213346 |
9 | 3804258152763 |
10 | 1100001122022 |
11 | 394564a57a90 |
12 | 159230197486 |
13 | 7c9640abbaa |
14 | 3b3516ba67c |
15 | 1d930b2359c |
hex | 1001d2d16e6 |
1100001122022 has 64 divisors (see below), whose sum is σ = 2492257517568. Its totient is φ = 320649252000.
The previous prime is 1100001121993. The next prime is 1100001122029. The reversal of 1100001122022 is 2202211000011.
It is a junction number, because it is equal to n+sod(n) for n = 1100001121989 and 1100001122007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100001122029) 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 31 ways as a sum of consecutive naturals, for example, 1268004 + ... + 1951367.
It is an arithmetic number, because the mean of its divisors is an integer number (38941523712).
Almost surely, 21100001122022 is an apocalyptic number.
1100001122022 is an abundant number, since it is smaller than the sum of its proper divisors (1392256395546).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100001122022 is a wasteful number, since it uses less digits than its factorization.
1100001122022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3219585.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1100001122022 its reverse (2202211000011), we get a palindrome (3302212122033).
It can be divided in two parts, 11000011 and 22022, that multiplied together give a palindrome (242242242242).
The spelling of 1100001122022 in words is "one trillion, one hundred billion, one million, one hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •