Base | Representation |
---|---|
bin | 11101010000111110111… |
… | …111001000110010111110 |
3 | 21010021000010011002011002 |
4 | 131100332333020302332 |
5 | 230422213431324042 |
6 | 4135515351130302 |
7 | 265203653062013 |
oct | 35207677106276 |
9 | 7107003132132 |
10 | 2011101433022 |
11 | 7059a3369820 |
12 | 285921973992 |
13 | 1178524b4856 |
14 | 6d4a300570a |
15 | 374a7906132 |
hex | 1d43efc8cbe |
2011101433022 has 8 divisors (see below), whose sum is σ = 3290893254072. Its totient is φ = 914137015000.
The previous prime is 2011101432973. The next prime is 2011101433037. The reversal of 2011101433022 is 2203341011102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 2011101432985 and 2011101433003.
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, 45706850729 + ... + 45706850772.
It is an arithmetic number, because the mean of its divisors is an integer number (411361656759).
Almost surely, 22011101433022 is an apocalyptic number.
2011101433022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2011101433022 is a deficient number, since it is larger than the sum of its proper divisors (1279791821050).
2011101433022 is a wasteful number, since it uses less digits than its factorization.
2011101433022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91413701514.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2011101433022 its reverse (2203341011102), we get a palindrome (4214442444124).
The spelling of 2011101433022 in words is "two trillion, eleven billion, one hundred one million, four hundred thirty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •