Base | Representation |
---|---|
bin | 111101000100000000… |
… | …1011111001110100111 |
3 | 110112110202022121021022 |
4 | 1322020001133032213 |
5 | 4122024031012221 |
6 | 140124002441355 |
7 | 12321360022025 |
oct | 1721001371647 |
9 | 415422277238 |
10 | 131131110311 |
11 | 50681103043 |
12 | 214b766325b |
13 | c49a328986 |
14 | 64bd7c5715 |
15 | 36272e24ab |
hex | 1e8805f3a7 |
131131110311 has 8 divisors (see below), whose sum is σ = 131363392800. Its totient is φ = 130898974752.
The previous prime is 131131110307. The next prime is 131131110323. The reversal of 131131110311 is 113011131131.
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 131131110311 - 22 = 131131110307 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 131131110311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131131110301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1833326 + ... + 1903508.
It is an arithmetic number, because the mean of its divisors is an integer number (16420424100).
Almost surely, 2131131110311 is an apocalyptic number.
131131110311 is a deficient number, since it is larger than the sum of its proper divisors (232282489).
131131110311 is an equidigital number, since it uses as much as digits as its factorization.
131131110311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73465.
The product of its (nonzero) digits is 27, while the sum is 17.
Adding to 131131110311 its reverse (113011131131), we get a palindrome (244142241442).
The spelling of 131131110311 in words is "one hundred thirty-one billion, one hundred thirty-one million, one hundred ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •