Base | Representation |
---|---|
bin | 11101010001000110000… |
… | …100001111100110011010 |
3 | 21010021022101122200110000 |
4 | 131101012010033212122 |
5 | 230422434333241442 |
6 | 4135535233033430 |
7 | 265206624506532 |
oct | 35210604174632 |
9 | 7107271580400 |
10 | 2011220212122 |
11 | 705a54417270 |
12 | 2859556b5876 |
13 | 117870ca1b44 |
14 | 6d4b4ac44c2 |
15 | 374b3069d4c |
hex | 1d44610f99a |
2011220212122 has 40 divisors (see below), whose sum is σ = 4916316078432. Its totient is φ = 609460669800.
The previous prime is 2011220212097. The next prime is 2011220212193. The reversal of 2011220212122 is 2212120221102.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 2011220212095 and 2011220212104.
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 564313654 + ... + 564317217.
Almost surely, 22011220212122 is an apocalyptic number.
2011220212122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2011220212122 is an abundant number, since it is smaller than the sum of its proper divisors (2905095866310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011220212122 is a wasteful number, since it uses less digits than its factorization.
2011220212122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1128630896 (or 1128630887 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 2011220212122 its reverse (2212120221102), we get a palindrome (4223340433224).
The spelling of 2011220212122 in words is "two trillion, eleven billion, two hundred twenty million, two hundred twelve thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •