Base | Representation |
---|---|
bin | 111101001001111100… |
… | …0100111001100000011 |
3 | 110112222121202211210222 |
4 | 1322103320213030003 |
5 | 4122431002011321 |
6 | 140155432013255 |
7 | 12326324342456 |
oct | 1722370471403 |
9 | 415877684728 |
10 | 131330110211 |
11 | 50773472673 |
12 | 2155223122b |
13 | c4cc6229b1 |
14 | 64dbdc749d |
15 | 3639a003ab |
hex | 1e93e27303 |
131330110211 has 8 divisors (see below), whose sum is σ = 131512222464. Its totient is φ = 131148089280.
The previous prime is 131330110151. The next prime is 131330110213. The reversal of 131330110211 is 112011033131.
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 131330110211 - 210 = 131330109187 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 131330110211.
It is not an unprimeable number, because it can be changed into a prime (131330110213) 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, 3156701 + ... + 3198033.
It is an arithmetic number, because the mean of its divisors is an integer number (16439027808).
Almost surely, 2131330110211 is an apocalyptic number.
131330110211 is a deficient number, since it is larger than the sum of its proper divisors (182112253).
131330110211 is an equidigital number, since it uses as much as digits as its factorization.
131330110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45661.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 131330110211 its reverse (112011033131), we get a palindrome (243341143342).
The spelling of 131330110211 in words is "one hundred thirty-one billion, three hundred thirty million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •