Base | Representation |
---|---|
bin | 10000001010110100101… |
… | …100001000011101001101 |
3 | 10221020000202211022010101 |
4 | 100022310230020131031 |
5 | 121201100023431341 |
6 | 2210240353011101 |
7 | 143163624631414 |
oct | 20126454103515 |
9 | 3836022738111 |
10 | 1111133030221 |
11 | 3992576a0415 |
12 | 15b418253a91 |
13 | 80a1943c716 |
14 | 3bac9cc647b |
15 | 1dd8306b831 |
hex | 102b4b0874d |
1111133030221 has 16 divisors (see below), whose sum is σ = 1135460833920. Its totient is φ = 1087073602560.
The previous prime is 1111133030171. The next prime is 1111133030281. The reversal of 1111133030221 is 1220303311111.
It is a cyclic number.
It is not a de Polignac number, because 1111133030221 - 27 = 1111133030093 is a prime.
It is a super-2 number, since 2×11111330302212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111133030281) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 46148616 + ... + 46172686.
It is an arithmetic number, because the mean of its divisors is an integer number (70966302120).
Almost surely, 21111133030221 is an apocalyptic number.
It is an amenable number.
1111133030221 is a deficient number, since it is larger than the sum of its proper divisors (24327803699).
1111133030221 is an equidigital number, since it uses as much as digits as its factorization.
1111133030221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29604.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1111133030221 its reverse (1220303311111), we get a palindrome (2331436341332).
The spelling of 1111133030221 in words is "one trillion, one hundred eleven billion, one hundred thirty-three million, thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •