Base | Representation |
---|---|
bin | 111101000011111111… |
… | …0011111000001000011 |
3 | 110112110200211121022001 |
4 | 1322013332133001003 |
5 | 4122023330314021 |
6 | 140123533524431 |
7 | 12321350232502 |
oct | 1720776370103 |
9 | 415420747261 |
10 | 131130323011 |
11 | 50680715586 |
12 | 214b7343717 |
13 | c49a11150c |
14 | 64bd65c839 |
15 | 36271d9091 |
hex | 1e87f9f043 |
131130323011 has 2 divisors, whose sum is σ = 131130323012. Its totient is φ = 131130323010.
The previous prime is 131130322997. The next prime is 131130323057. The reversal of 131130323011 is 110323031131.
It is a weak prime.
It is an emirp because it is prime and its reverse (110323031131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131130323011 - 215 = 131130290243 is a prime.
It is a super-2 number, since 2×1311303230112 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 131130323011.
It is not a weakly prime, because it can be changed into another prime (131130327011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65565161505 + 65565161506.
It is an arithmetic number, because the mean of its divisors is an integer number (65565161506).
Almost surely, 2131130323011 is an apocalyptic number.
131130323011 is a deficient number, since it is larger than the sum of its proper divisors (1).
131130323011 is an equidigital number, since it uses as much as digits as its factorization.
131130323011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 131130323011 its reverse (110323031131), we get a palindrome (241453354142).
The spelling of 131130323011 in words is "one hundred thirty-one billion, one hundred thirty million, three hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •