Base | Representation |
---|---|
bin | 1001001001000001010000… |
… | …01111111100000010100010 |
3 | 2122011122111202202010100221 |
4 | 10210200220033330002202 |
5 | 10113314044241241002 |
6 | 110430154510033254 |
7 | 4143154355444326 |
oct | 444405017740242 |
9 | 78148452663327 |
10 | 20101122212002 |
11 | 644a9244a9677 |
12 | 23078951a882a |
13 | b2a6b2450340 |
14 | 4d6c8435d986 |
15 | 24cd22892c37 |
hex | 1248283fc0a2 |
20101122212002 has 8 divisors (see below), whose sum is σ = 32471043573276. Its totient is φ = 9277441020912.
The previous prime is 20101122211981. The next prime is 20101122212009. The reversal of 20101122212002 is 20021222110102.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 17799041269881 + 2302080942121 = 4218891^2 + 1517261^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×201011222120022 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20101122212009) 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 3 ways as a sum of consecutive naturals, for example, 386560042513 + ... + 386560042564.
Almost surely, 220101122212002 is an apocalyptic number.
20101122212002 is a deficient number, since it is larger than the sum of its proper divisors (12369921361274).
20101122212002 is a wasteful number, since it uses less digits than its factorization.
20101122212002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 773120085092.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20101122212002 its reverse (20021222110102), we get a palindrome (40122344322104).
The spelling of 20101122212002 in words is "twenty trillion, one hundred one billion, one hundred twenty-two million, two hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •