Base | Representation |
---|---|
bin | 1010000011010000001011… |
… | …11011100111101000000110 |
3 | 2220020221010110121012202120 |
4 | 11001220011323213220012 |
5 | 10344104344303020402 |
6 | 115001304051150410 |
7 | 4440550123421256 |
oct | 501500573475006 |
9 | 86227113535676 |
10 | 22102001220102 |
11 | 7051451544231 |
12 | 258b6235a5406 |
13 | c44295b3b33b |
14 | 565a57863966 |
15 | 284dccb023bc |
hex | 141a05ee7a06 |
22102001220102 has 8 divisors (see below), whose sum is σ = 44204002440216. Its totient is φ = 7367333740032.
The previous prime is 22102001220067. The next prime is 22102001220107. The reversal of 22102001220102 is 20102210020122.
It is a sphenic number, since it is the product of 3 distinct primes.
22102001220102 is an admirable number.
It is a super-3 number, since 3×221020012201023 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22102001220107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1841833435003 + ... + 1841833435014.
It is an arithmetic number, because the mean of its divisors is an integer number (5525500305027).
Almost surely, 222102001220102 is an apocalyptic number.
22102001220102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22102001220102 is a wasteful number, since it uses less digits than its factorization.
22102001220102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3683666870022.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 22102001220102 its reverse (20102210020122), we get a palindrome (42204211240224).
The spelling of 22102001220102 in words is "twenty-two trillion, one hundred two billion, one million, two hundred twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •