Base | Representation |
---|---|
bin | 11001100000110111111010… |
… | …011011000111100111101110 |
3 | 112201022012012022012210101201 |
4 | 121200313322123013213232 |
5 | 104201423013314133402 |
6 | 1034352355300200114 |
7 | 32430630622645462 |
oct | 3140677233074756 |
9 | 481265168183351 |
10 | 112210222021102 |
11 | 328320a701a9a7 |
12 | 1070311439903a |
13 | 4a7c4bc83979a |
14 | 1d9d00a30a4a2 |
15 | ce8ca327b687 |
hex | 660dfa6c79ee |
112210222021102 has 8 divisors (see below), whose sum is σ = 168319287100800. Its totient is φ = 56103792987504.
The previous prime is 112210222021067. The next prime is 112210222021109. The reversal of 112210222021102 is 201120222012211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1122102220211022 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 112210222021102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112210222021109) 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, 658905102 + ... + 659075377.
It is an arithmetic number, because the mean of its divisors is an integer number (21039910887600).
Almost surely, 2112210222021102 is an apocalyptic number.
112210222021102 is a deficient number, since it is larger than the sum of its proper divisors (56109065079698).
112210222021102 is a wasteful number, since it uses less digits than its factorization.
112210222021102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1318023050.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 112210222021102 its reverse (201120222012211), we get a palindrome (313330444033313).
The spelling of 112210222021102 in words is "one hundred twelve trillion, two hundred ten billion, two hundred twenty-two million, twenty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •