Base | Representation |
---|---|
bin | 1001000110101110010001… |
… | …10101110010101101100010 |
3 | 2121220002211101110200000000 |
4 | 10203113020311302231202 |
5 | 10111020442300024302 |
6 | 110330024404440430 |
7 | 4134362036606400 |
oct | 443271065625542 |
9 | 77802741420000 |
10 | 20022212111202 |
11 | 641a410838a34 |
12 | 22b45323a9116 |
13 | b231180707c2 |
14 | 4d311a254470 |
15 | 24ac54e1231c |
hex | 1235c8d72b62 |
20022212111202 has 108 divisors (see below), whose sum is σ = 52402414805910. Its totient is φ = 5720631848064.
The previous prime is 20022212111201. The next prime is 20022212111249. The reversal of 20022212111202 is 20211121222002.
It is a happy number.
20022212111202 is a `hidden beast` number, since 200 + 222 + 121 + 1 + 120 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 13445341570521 + 6576870540681 = 3666789^2 + 2564541^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (20022212111201) by changing a digit.
It is a polite number, since it can be written in 53 ways as a sum of consecutive naturals, for example, 14926927 + ... + 16212882.
Almost surely, 220022212111202 is an apocalyptic number.
20022212111202 is an abundant number, since it is smaller than the sum of its proper divisors (32380202694708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20022212111202 is an frugal number, since it uses more digits than its factorization.
20022212111202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31139849 (or 31139821 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 20022212111202 its reverse (20211121222002), we get a palindrome (40233333333204).
The spelling of 20022212111202 in words is "twenty trillion, twenty-two billion, two hundred twelve million, one hundred eleven thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •