Base | Representation |
---|---|
bin | 11001001111011010011011… |
… | …010110001111011001011011 |
3 | 112120001111001211121222001202 |
4 | 121033122123112033121123 |
5 | 104022243124220444011 |
6 | 1032033235252104415 |
7 | 32245142326552100 |
oct | 3117323326173133 |
9 | 476044054558052 |
10 | 111010331031131 |
11 | 3240a242919744 |
12 | 1054a66730510b |
13 | 49c32c99cb66c |
14 | 1d5ad0047aaa7 |
15 | cc7977e2523b |
hex | 64f69b58f65b |
111010331031131 has 12 divisors (see below), whose sum is σ = 129441199433760. Its totient is φ = 94925698726320.
The previous prime is 111010331031071. The next prime is 111010331031199. The reversal of 111010331031131 is 131130133010111.
It is a happy number.
It is not a de Polignac number, because 111010331031131 - 238 = 110735453124187 is a prime.
It is a super-2 number, since 2×1110103310311312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111010331031631) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2690617091 + ... + 2690658348.
It is an arithmetic number, because the mean of its divisors is an integer number (10786766619480).
Almost surely, 2111010331031131 is an apocalyptic number.
111010331031131 is a deficient number, since it is larger than the sum of its proper divisors (18430868402629).
111010331031131 is an equidigital number, since it uses as much as digits as its factorization.
111010331031131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5381275874 (or 5381275867 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 20.
Adding to 111010331031131 its reverse (131130133010111), we get a palindrome (242140464041242).
The spelling of 111010331031131 in words is "one hundred eleven trillion, ten billion, three hundred thirty-one million, thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •