Base | Representation |
---|---|
bin | 10000001010111000101… |
… | …011101001011101100011 |
3 | 10221020012102212100000212 |
4 | 100022320223221131203 |
5 | 121201214200342011 |
6 | 2210251144404335 |
7 | 143165400155066 |
oct | 20127053513543 |
9 | 3836172770025 |
10 | 1111200012131 |
11 | 39929148a970 |
12 | 15b4367766ab |
13 | 80a2a2925a1 |
14 | 3bad4b608dd |
15 | 1dd88d9d08b |
hex | 102b8ae9763 |
1111200012131 has 8 divisors (see below), whose sum is σ = 1212821012928. Its totient is φ = 1009679481000.
The previous prime is 1111200011989. The next prime is 1111200012239. The reversal of 1111200012131 is 1312100021111.
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 1111200012131 - 210 = 1111200011107 is a prime.
It is a super-2 number, since 2×11112000121312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1111200012331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25094285 + ... + 25138526.
It is an arithmetic number, because the mean of its divisors is an integer number (151602626616).
Almost surely, 21111200012131 is an apocalyptic number.
1111200012131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1111200012131 is a deficient number, since it is larger than the sum of its proper divisors (101621000797).
1111200012131 is a wasteful number, since it uses less digits than its factorization.
1111200012131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50234833.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1111200012131 its reverse (1312100021111), we get a palindrome (2423300033242).
The spelling of 1111200012131 in words is "one trillion, one hundred eleven billion, two hundred million, twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •