Base | Representation |
---|---|
bin | 11101110101001110100101… |
… | …100010001110000110110111 |
3 | 122012112201002020212002101122 |
4 | 131311032211202032012313 |
5 | 114144044420124432411 |
6 | 1143012550105214155 |
7 | 36430653431363564 |
oct | 3565164542160667 |
9 | 565481066762348 |
10 | 131201143202231 |
11 | 38894101a27053 |
12 | 1286b7b149135b |
13 | 58292a3968acb |
14 | 245825246d86b |
15 | 1027c998009db |
hex | 7753a588e1b7 |
131201143202231 has 2 divisors, whose sum is σ = 131201143202232. Its totient is φ = 131201143202230.
The previous prime is 131201143202219. The next prime is 131201143202237. The reversal of 131201143202231 is 132202341102131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131201143202231 - 230 = 131200069460407 is a prime.
It is a super-2 number, since 2×1312011432022312 (a number of 29 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 131201143202231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131201143202237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65600571601115 + 65600571601116.
It is an arithmetic number, because the mean of its divisors is an integer number (65600571601116).
Almost surely, 2131201143202231 is an apocalyptic number.
131201143202231 is a deficient number, since it is larger than the sum of its proper divisors (1).
131201143202231 is an equidigital number, since it uses as much as digits as its factorization.
131201143202231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 131201143202231 its reverse (132202341102131), we get a palindrome (263403484304362).
The spelling of 131201143202231 in words is "one hundred thirty-one trillion, two hundred one billion, one hundred forty-three million, two hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •