Base | Representation |
---|---|
bin | 100000110010100… |
… | …0000111010100001 |
3 | 2211200021002000011 |
4 | 1001211000322201 |
5 | 4223124101423 |
6 | 301101324521 |
7 | 36156506434 |
oct | 10145007241 |
9 | 2750232004 |
10 | 1100222113 |
11 | 515057181 |
12 | 268566741 |
13 | 146c2ab03 |
14 | a619981b |
15 | 668cbb0d |
hex | 41940ea1 |
1100222113 has 8 divisors (see below), whose sum is σ = 1166463200. Its totient is φ = 1034814528.
The previous prime is 1100222093. The next prime is 1100222119. The reversal of 1100222113 is 3112220011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1100222113 - 29 = 1100221601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1100222093 and 1100222102.
It is not an unprimeable number, because it can be changed into a prime (1100222119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 205656 + ... + 210937.
It is an arithmetic number, because the mean of its divisors is an integer number (145807900).
Almost surely, 21100222113 is an apocalyptic number.
It is an amenable number.
1100222113 is a deficient number, since it is larger than the sum of its proper divisors (66241087).
1100222113 is a wasteful number, since it uses less digits than its factorization.
1100222113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 416751.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1100222113 is about 33169.5962140030. The cubic root of 1100222113 is about 1032.3495904269.
Adding to 1100222113 its reverse (3112220011), we get a palindrome (4212442124).
The spelling of 1100222113 in words is "one billion, one hundred million, two hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •