Base | Representation |
---|---|
bin | 111101001001111110… |
… | …0100000001101011001 |
3 | 110112222200200122222101 |
4 | 1322103330200031121 |
5 | 4122431232131301 |
6 | 140155505523401 |
7 | 12326336121265 |
oct | 1722374401531 |
9 | 415880618871 |
10 | 131331130201 |
11 | 50773aa9a37 |
12 | 21552643561 |
13 | c4cc8bc03b |
14 | 64dc1b10a5 |
15 | 3639b52701 |
hex | 1e93f20359 |
131331130201 has 4 divisors (see below), whose sum is σ = 135567618304. Its totient is φ = 127094642100.
The previous prime is 131331130199. The next prime is 131331130211. The reversal of 131331130201 is 102031133131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 131331130201 - 21 = 131331130199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131331130211) 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 3 ways as a sum of consecutive naturals, for example, 2118244005 + ... + 2118244066.
It is an arithmetic number, because the mean of its divisors is an integer number (33891904576).
Almost surely, 2131331130201 is an apocalyptic number.
It is an amenable number.
131331130201 is a deficient number, since it is larger than the sum of its proper divisors (4236488103).
131331130201 is an equidigital number, since it uses as much as digits as its factorization.
131331130201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4236488102.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 131331130201 its reverse (102031133131), we get a palindrome (233362263332).
The spelling of 131331130201 in words is "one hundred thirty-one billion, three hundred thirty-one million, one hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •