Base | Representation |
---|---|
bin | 1010000011001100100001… |
… | …00100011001111000010100 |
3 | 2220020202001020112122020222 |
4 | 11001212100210121320110 |
5 | 10344041331220401322 |
6 | 115000340432213512 |
7 | 4440450254136431 |
oct | 501462044317024 |
9 | 86222036478228 |
10 | 22100032200212 |
11 | 705063103746a |
12 | 258b17409a298 |
13 | c44040c20105 |
14 | 56590c150b88 |
15 | 284d14d0de42 |
hex | 141990919e14 |
22100032200212 has 24 divisors (see below), whose sum is σ = 38703240203040. Its totient is φ = 11041966383840.
The previous prime is 22100032200203. The next prime is 22100032200229. The reversal of 22100032200212 is 21200223000122.
22100032200212 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×221000322002122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 31335563 + ... + 32033069.
It is an arithmetic number, because the mean of its divisors is an integer number (1612635008460).
Almost surely, 222100032200212 is an apocalyptic number.
It is an amenable number.
22100032200212 is a deficient number, since it is larger than the sum of its proper divisors (16603208002828).
22100032200212 is a wasteful number, since it uses less digits than its factorization.
22100032200212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 703271 (or 703269 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 22100032200212 its reverse (21200223000122), we get a palindrome (43300255200334).
The spelling of 22100032200212 in words is "twenty-two trillion, one hundred billion, thirty-two million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •