Base | Representation |
---|---|
bin | 11101110010011101011010… |
… | …100010010000001000111011 |
3 | 122011212112001022200010021022 |
4 | 131302131122202100020323 |
5 | 114132440314011431311 |
6 | 1142345325101333055 |
7 | 36411140251032536 |
oct | 3562353242201073 |
9 | 564775038603238 |
10 | 131010906358331 |
11 | 388204602125aa |
12 | 1283a95b56718b |
13 | 581437724c99c |
14 | 244cd66c9ba1d |
15 | 1022d635535db |
hex | 77275a89023b |
131010906358331 has 2 divisors, whose sum is σ = 131010906358332. Its totient is φ = 131010906358330.
The previous prime is 131010906358303. The next prime is 131010906358337. The reversal of 131010906358331 is 133853609010131.
It is a strong prime.
It is an emirp because it is prime and its reverse (133853609010131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131010906358331 - 246 = 60642162180667 is a prime.
It is a super-2 number, since 2×1310109063583312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131010906358337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65505453179165 + 65505453179166.
It is an arithmetic number, because the mean of its divisors is an integer number (65505453179166).
Almost surely, 2131010906358331 is an apocalyptic number.
131010906358331 is a deficient number, since it is larger than the sum of its proper divisors (1).
131010906358331 is an equidigital number, since it uses as much as digits as its factorization.
131010906358331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 174960, while the sum is 44.
The spelling of 131010906358331 in words is "one hundred thirty-one trillion, ten billion, nine hundred six million, three hundred fifty-eight thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •