Base | Representation |
---|---|
bin | 110011010100110111… |
… | …1111100101011100101 |
3 | 101112111120022212222020 |
4 | 1212221233330223211 |
5 | 3301213324214341 |
6 | 122345122053353 |
7 | 10651256254611 |
oct | 1465157745345 |
9 | 345446285866 |
10 | 110222101221 |
11 | 42821559041 |
12 | 194411aa259 |
13 | a517521b4b |
14 | 54988ba341 |
15 | 2d0186a566 |
hex | 19a9bfcae5 |
110222101221 has 32 divisors (see below), whose sum is σ = 156193090560. Its totient is φ = 68899151616.
The previous prime is 110222101217. The next prime is 110222101229. The reversal of 110222101221 is 122101222011.
It is not a de Polignac number, because 110222101221 - 22 = 110222101217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110222101221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110222101229) 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 31 ways as a sum of consecutive naturals, for example, 28649520 + ... + 28653366.
It is an arithmetic number, because the mean of its divisors is an integer number (4881034080).
Almost surely, 2110222101221 is an apocalyptic number.
It is an amenable number.
110222101221 is a deficient number, since it is larger than the sum of its proper divisors (45970989339).
110222101221 is a wasteful number, since it uses less digits than its factorization.
110222101221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5833.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 110222101221 its reverse (122101222011), we get a palindrome (232323323232).
The spelling of 110222101221 in words is "one hundred ten billion, two hundred twenty-two million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •