Base | Representation |
---|---|
bin | 10111001111100001101010… |
… | …101010100111101001000000 |
3 | 111101221022212201101222122001 |
4 | 113033201222222213221000 |
5 | 101344301134331431422 |
6 | 1001224051010153344 |
7 | 30350203505550244 |
oct | 2717415252475100 |
9 | 441838781358561 |
10 | 102222011202112 |
11 | 2a63112544608a |
12 | b56b388882854 |
13 | 4506656c71219 |
14 | 1b35800bdc424 |
15 | bc4068314227 |
hex | 5cf86aaa7a40 |
102222011202112 has 28 divisors (see below), whose sum is σ = 202948277872000. Its totient is φ = 51085437250176.
The previous prime is 102222011202067. The next prime is 102222011202119. The reversal of 102222011202112 is 211202110222201.
It is a super-2 number, since 2×1022220112021122 (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 102222011202112.
It is not an unprimeable number, because it can be changed into a prime (102222011202119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 399376548 + ... + 399632419.
Almost surely, 2102222011202112 is an apocalyptic number.
It is an amenable number.
102222011202112 is a deficient number, since it is larger than the sum of its proper divisors (100726266669888).
102222011202112 is an equidigital number, since it uses as much as digits as its factorization.
102222011202112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 799010978 (or 799010968 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 102222011202112 its reverse (211202110222201), we get a palindrome (313424121424313).
The spelling of 102222011202112 in words is "one hundred two trillion, two hundred twenty-two billion, eleven million, two hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •