Base | Representation |
---|---|
bin | 11101010000111010001… |
… | …100010110100001001110 |
3 | 21010020210111211012220111 |
4 | 131100322030112201032 |
5 | 230422032334323042 |
6 | 4135503355310234 |
7 | 265201655360362 |
oct | 35207214264116 |
9 | 7106714735814 |
10 | 2011021011022 |
11 | 705961a2a561 |
12 | 2858baa4b37a |
13 | 11783b93737a |
14 | 6d49646d2a2 |
15 | 374a081c517 |
hex | 1d43a31684e |
2011021011022 has 8 divisors (see below), whose sum is σ = 3025076932656. Its totient is φ = 1002662033472.
The previous prime is 2011021011017. The next prime is 2011021011023. The reversal of 2011021011022 is 2201101201102.
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 = 2011021010993 and 2011021011011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011021011023) 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 3 ways as a sum of consecutive naturals, for example, 1424235138 + ... + 1424236549.
It is an arithmetic number, because the mean of its divisors is an integer number (378134616582).
Almost surely, 22011021011022 is an apocalyptic number.
2011021011022 is a deficient number, since it is larger than the sum of its proper divisors (1014055921634).
2011021011022 is a wasteful number, since it uses less digits than its factorization.
2011021011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2848472042.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2011021011022 its reverse (2201101201102), we get a palindrome (4212122212124).
The spelling of 2011021011022 in words is "two trillion, eleven billion, twenty-one million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •