Base | Representation |
---|---|
bin | 11001000010001100101010… |
… | …100101011110011110111110 |
3 | 112102211200000200221121020020 |
4 | 121002030222211132132332 |
5 | 103412403301440201342 |
6 | 1030100130344033010 |
7 | 32122423116526062 |
oct | 3102145245363676 |
9 | 472750020847206 |
10 | 110102201100222 |
11 | 3209a099187491 |
12 | 10422664462766 |
13 | 4958792b09266 |
14 | 1d28d91447aa2 |
15 | cae026cd50ec |
hex | 64232a95e7be |
110102201100222 has 8 divisors (see below), whose sum is σ = 220204402200456. Its totient is φ = 36700733700072.
The previous prime is 110102201100211. The next prime is 110102201100299. The reversal of 110102201100222 is 222001102201011.
It is a sphenic number, since it is the product of 3 distinct primes.
110102201100222 is an admirable number.
It is a super-2 number, since 2×1101022011002222 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9175183425013 + ... + 9175183425024.
It is an arithmetic number, because the mean of its divisors is an integer number (27525550275057).
Almost surely, 2110102201100222 is an apocalyptic number.
110102201100222 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.
110102201100222 is a wasteful number, since it uses less digits than its factorization.
110102201100222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18350366850042.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 110102201100222 its reverse (222001102201011), we get a palindrome (332103303301233).
The spelling of 110102201100222 in words is "one hundred ten trillion, one hundred two billion, two hundred one million, one hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •