Base | Representation |
---|---|
bin | 111101001001111110… |
… | …0011011010011011111 |
3 | 110112222200122122102022 |
4 | 1322103330123103133 |
5 | 4122431231010421 |
6 | 140155505250355 |
7 | 12326336005565 |
oct | 1722374332337 |
9 | 415880578368 |
10 | 131331110111 |
11 | 50773a95933 |
12 | 215526339bb |
13 | c4cc8b2b56 |
14 | 64dc1a7a35 |
15 | 3639b4b7ab |
hex | 1e93f1b4df |
131331110111 has 4 divisors (see below), whose sum is σ = 132117524112. Its totient is φ = 130544696112.
The previous prime is 131331110107. The next prime is 131331110137. The reversal of 131331110111 is 111011133131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111011133131 = 35059 ⋅3166409.
It is a cyclic number.
It is not a de Polignac number, because 131331110111 - 22 = 131331110107 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131331110111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131331110011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 393206750 + ... + 393207083.
It is an arithmetic number, because the mean of its divisors is an integer number (33029381028).
Almost surely, 2131331110111 is an apocalyptic number.
131331110111 is a deficient number, since it is larger than the sum of its proper divisors (786414001).
131331110111 is an equidigital number, since it uses as much as digits as its factorization.
131331110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 786414000.
The product of its (nonzero) digits is 27, while the sum is 17.
Adding to 131331110111 its reverse (111011133131), we get a palindrome (242342243242).
The spelling of 131331110111 in words is "one hundred thirty-one billion, three hundred thirty-one million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •