Base | Representation |
---|---|
bin | 100000010100011111000… |
… | …111110000101100110100 |
3 | 21212022211201101100202000 |
4 | 200110133013300230310 |
5 | 242342122134021322 |
6 | 4420153403215300 |
7 | 316314644243643 |
oct | 40243707605464 |
9 | 7768751340660 |
10 | 2221020220212 |
11 | 786a25015602 |
12 | 2ba547217530 |
13 | 131597727a71 |
14 | 796d854935a |
15 | 3cb91a453ac |
hex | 2051f1f0b34 |
2221020220212 has 48 divisors (see below), whose sum is σ = 5759264683200. Its totient is φ = 740203259040.
The previous prime is 2221020220207. The next prime is 2221020220229. The reversal of 2221020220212 is 2120220201222.
2221020220212 is a `hidden beast` number, since 2 + 2 + 210 + 20 + 220 + 212 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 1312239 + ... + 2482742.
It is an arithmetic number, because the mean of its divisors is an integer number (119984680900).
Almost surely, 22221020220212 is an apocalyptic number.
It is an amenable number.
2221020220212 is an abundant number, since it is smaller than the sum of its proper divisors (3538244462988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2221020220212 is a wasteful number, since it uses less digits than its factorization.
2221020220212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3800413 (or 3800405 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 2221020220212 its reverse (2120220201222), we get a palindrome (4341240421434).
The spelling of 2221020220212 in words is "two trillion, two hundred twenty-one billion, twenty million, two hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •