Base | Representation |
---|---|
bin | 10000001011110101100… |
… | …011010010100000000111 |
3 | 10221022211121110122010001 |
4 | 100023311203102200013 |
5 | 121210312113343421 |
6 | 2210540344542131 |
7 | 143232610322644 |
oct | 20136543224007 |
9 | 3838747418101 |
10 | 1112221231111 |
11 | 3997659868a1 |
12 | 15b680781947 |
13 | 80b60a1b983 |
14 | 3bb90632dcb |
15 | 1dde8871691 |
hex | 102f58d2807 |
1112221231111 has 16 divisors (see below), whose sum is σ = 1137406722048. Its totient is φ = 1087100078400.
The previous prime is 1112221231109. The next prime is 1112221231133. The reversal of 1112221231111 is 1111321222111.
It is a cyclic number.
It is not a de Polignac number, because 1112221231111 - 21 = 1112221231109 is a prime.
It is a super-3 number, since 3×11122212311113 (a number of 37 digits) contains 333 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 (1112221231181) 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, 230223466 + ... + 230228296.
It is an arithmetic number, because the mean of its divisors is an integer number (71087920128).
Almost surely, 21112221231111 is an apocalyptic number.
1112221231111 is a deficient number, since it is larger than the sum of its proper divisors (25185490937).
1112221231111 is a wasteful number, since it uses less digits than its factorization.
1112221231111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10422.
The product of its digits is 48, while the sum is 19.
Adding to 1112221231111 its reverse (1111321222111), we get a palindrome (2223542453222).
The spelling of 1112221231111 in words is "one trillion, one hundred twelve billion, two hundred twenty-one million, two hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •