Base | Representation |
---|---|
bin | 110011010001001111… |
… | …1000000110100100110 |
3 | 101112012001222202001012 |
4 | 1212202133000310212 |
5 | 3300441124034342 |
6 | 122325045502222 |
7 | 10645246303415 |
oct | 1464237006446 |
9 | 345161882035 |
10 | 110100221222 |
11 | 42769782872 |
12 | 19408411972 |
13 | a4c81ba2c4 |
14 | 548663147c |
15 | 2ce5ce2b82 |
hex | 19a27c0d26 |
110100221222 has 8 divisors (see below), whose sum is σ = 165151999272. Its totient is φ = 55049554800.
The previous prime is 110100221213. The next prime is 110100221239. The reversal of 110100221222 is 222122001011.
110100221222 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 110100221197 and 110100221206.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44522 + ... + 471362.
It is an arithmetic number, because the mean of its divisors is an integer number (20643999909).
Almost surely, 2110100221222 is an apocalyptic number.
110100221222 is a deficient number, since it is larger than the sum of its proper divisors (55051778050).
110100221222 is a wasteful number, since it uses less digits than its factorization.
110100221222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 555814.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 110100221222 its reverse (222122001011), we get a palindrome (332222222233).
The spelling of 110100221222 in words is "one hundred ten billion, one hundred million, two hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •