Base | Representation |
---|---|
bin | 100000010100011111001… |
… | …010110001100011000000 |
3 | 21212022211202212111021120 |
4 | 200110133022301203000 |
5 | 242342122334310422 |
6 | 4420153432152240 |
7 | 316314654043602 |
oct | 40243712614300 |
9 | 7768752774246 |
10 | 2221021010112 |
11 | 786a25505013 |
12 | 2ba547538680 |
13 | 131597943468 |
14 | 796d86b3172 |
15 | 3cb91b4e45c |
hex | 2051f2b18c0 |
2221021010112 has 112 divisors (see below), whose sum is σ = 5963147384832. Its totient is φ = 729439119360.
The previous prime is 2221021010099. The next prime is 2221021010123. The reversal of 2221021010112 is 2110101201222.
It is a super-3 number, since 3×22210210101123 (a number of 38 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2221021010091 and 2221021010100.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13471537 + ... + 13635407.
Almost surely, 22221021010112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2221021010112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2981573692416).
2221021010112 is an abundant number, since it is smaller than the sum of its proper divisors (3742126374720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2221021010112 is a wasteful number, since it uses less digits than its factorization.
2221021010112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 164926 (or 164916 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2221021010112 its reverse (2110101201222), we get a palindrome (4331122211334).
The spelling of 2221021010112 in words is "two trillion, two hundred twenty-one billion, twenty-one million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •