Base | Representation |
---|---|
bin | 111101000001001010… |
… | …0000101101110110001 |
3 | 110112020002002010012201 |
4 | 1322002110011232301 |
5 | 4121330020321223 |
6 | 140110301423201 |
7 | 12316114604446 |
oct | 1720224055661 |
9 | 415202063181 |
10 | 131035323313 |
11 | 50632029934 |
12 | 2148b56ab01 |
13 | c48352b98b |
14 | 64b0bad9cd |
15 | 361dbc0ead |
hex | 1e82505bb1 |
131035323313 has 2 divisors, whose sum is σ = 131035323314. Its totient is φ = 131035323312.
The previous prime is 131035323269. The next prime is 131035323361. The reversal of 131035323313 is 313323530131.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108225866529 + 22809456784 = 328977^2 + 151028^2 .
It is an emirp because it is prime and its reverse (313323530131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131035323313 is a prime.
It is not a weakly prime, because it can be changed into another prime (131035323413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65517661656 + 65517661657.
It is an arithmetic number, because the mean of its divisors is an integer number (65517661657).
Almost surely, 2131035323313 is an apocalyptic number.
It is an amenable number.
131035323313 is a deficient number, since it is larger than the sum of its proper divisors (1).
131035323313 is an equidigital number, since it uses as much as digits as its factorization.
131035323313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7290, while the sum is 28.
Adding to 131035323313 its reverse (313323530131), we get a palindrome (444358853444).
The spelling of 131035323313 in words is "one hundred thirty-one billion, thirty-five million, three hundred twenty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •