Base | Representation |
---|---|
bin | 10000001011000000000… |
… | …010000000001111101011 |
3 | 10221020112000212200012120 |
4 | 100023000002000033223 |
5 | 121201442232010011 |
6 | 2210311311242323 |
7 | 143201425205163 |
oct | 20130002001753 |
9 | 3836460780176 |
10 | 1111323313131 |
11 | 399345046819 |
12 | 15b46bb193a3 |
13 | 80a499a3b65 |
14 | 3bb072995a3 |
15 | 1dd94b06a06 |
hex | 102c00803eb |
1111323313131 has 8 divisors (see below), whose sum is σ = 1481823489024. Its totient is φ = 740852673000.
The previous prime is 1111323313127. The next prime is 1111323313141. The reversal of 1111323313131 is 1313133231111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1111323313131 - 22 = 1111323313127 is a prime.
It is a super-2 number, since 2×11113233131312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1111323313141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7295995 + ... + 7446756.
It is an arithmetic number, because the mean of its divisors is an integer number (185227936128).
Almost surely, 21111323313131 is an apocalyptic number.
1111323313131 is a deficient number, since it is larger than the sum of its proper divisors (370500175893).
1111323313131 is a wasteful number, since it uses less digits than its factorization.
1111323313131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14767881.
The product of its digits is 486, while the sum is 24.
Adding to 1111323313131 its reverse (1313133231111), we get a palindrome (2424456544242).
The spelling of 1111323313131 in words is "one trillion, one hundred eleven billion, three hundred twenty-three million, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •