Base | Representation |
---|---|
bin | 11001000010001100101011… |
… | …001011001111101110000110 |
3 | 112102211200001101120121211221 |
4 | 121002030223023033232012 |
5 | 103412403312004014342 |
6 | 1030100131340150554 |
7 | 32122423266634006 |
oct | 3102145313175606 |
9 | 472750041517757 |
10 | 110102211001222 |
11 | 3209a0a382a230 |
12 | 1042266783845a |
13 | 4958794b94a3b |
14 | 1d28d928a4006 |
15 | cae027adda67 |
hex | 64232b2cfb86 |
110102211001222 has 8 divisors (see below), whose sum is σ = 180167254365672. Its totient is φ = 50046459546000.
The previous prime is 110102211001213. The next prime is 110102211001291. The reversal of 110102211001222 is 222100112201011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1101022110012222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110102211001196 and 110102211001205.
It is a congruent number.
It is an unprimeable number.
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, 2502322977279 + ... + 2502322977322.
It is an arithmetic number, because the mean of its divisors is an integer number (22520906795709).
Almost surely, 2110102211001222 is an apocalyptic number.
110102211001222 is a deficient number, since it is larger than the sum of its proper divisors (70065043364450).
110102211001222 is a wasteful number, since it uses less digits than its factorization.
110102211001222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5004645954614.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 110102211001222 its reverse (222100112201011), we get a palindrome (332202323202233).
The spelling of 110102211001222 in words is "one hundred ten trillion, one hundred two billion, two hundred eleven million, one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •