Base | Representation |
---|---|
bin | 11001000000101101101100… |
… | …001010111000101111001101 |
3 | 112102110220210121200021022220 |
4 | 121000231230022320233031 |
5 | 103404220423341223041 |
6 | 1025541223210325553 |
7 | 32112153023342232 |
oct | 3100555412705715 |
9 | 472426717607286 |
10 | 110000222211021 |
11 | 3205a91781366a |
12 | 10406943a298b9 |
13 | 494bc9033437c |
14 | 1d24079665789 |
15 | cab558ea7d66 |
hex | 640b6c2b8bcd |
110000222211021 has 8 divisors (see below), whose sum is σ = 146709340009824. Its totient is φ = 73312292943120.
The previous prime is 110000222210917. The next prime is 110000222211059. The reversal of 110000222211021 is 120112222000011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110000222211021 - 217 = 110000222079949 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110000222211221) 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 7 ways as a sum of consecutive naturals, for example, 5297120611 + ... + 5297141376.
It is an arithmetic number, because the mean of its divisors is an integer number (18338667501228).
Almost surely, 2110000222211021 is an apocalyptic number.
It is an amenable number.
110000222211021 is a deficient number, since it is larger than the sum of its proper divisors (36709117798803).
110000222211021 is a wasteful number, since it uses less digits than its factorization.
110000222211021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10594265451.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 110000222211021 its reverse (120112222000011), we get a palindrome (230112444211032).
The spelling of 110000222211021 in words is "one hundred ten trillion, two hundred twenty-two million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •