Base | Representation |
---|---|
bin | 1001001100100010011011… |
… | …10010011111101010110000 |
3 | 2122121012112201112112120200 |
4 | 10212101031302133222300 |
5 | 10122304134321041422 |
6 | 111001510314435200 |
7 | 4154664200235255 |
oct | 446211562375260 |
9 | 78535481475520 |
10 | 20222011112112 |
11 | 649711a0a4587 |
12 | 23271b2732b00 |
13 | b38c098459b4 |
14 | 4dca7177342c |
15 | 25104a8d12ac |
hex | 12644dc9fab0 |
20222011112112 has 60 divisors (see below), whose sum is σ = 56605793884224. Its totient is φ = 6739211445120.
The previous prime is 20222011112101. The next prime is 20222011112113. The reversal of 20222011112112 is 21121111022202.
20222011112112 is a `hidden beast` number, since 202 + 220 + 111 + 121 + 12 = 666.
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 (20222011112113) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14529408 + ... + 15860255.
Almost surely, 220222011112112 is an apocalyptic number.
It is an amenable number.
20222011112112 is an abundant number, since it is smaller than the sum of its proper divisors (36383782772112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20222011112112 is a wasteful number, since it uses less digits than its factorization.
20222011112112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30394298 (or 30394289 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 20222011112112 its reverse (21121111022202), we get a palindrome (41343122134314).
It can be divided in two parts, 2022201 and 1112112, that added together give a palindrome (3134313).
The spelling of 20222011112112 in words is "twenty trillion, two hundred twenty-two billion, eleven million, one hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •