Base | Representation |
---|---|
bin | 111101000011000101… |
… | …1101100011010101001 |
3 | 110112101121012210021121 |
4 | 1322012023230122221 |
5 | 4121443124400322 |
6 | 140120540535241 |
7 | 12320533402615 |
oct | 1720613543251 |
9 | 415347183247 |
10 | 131100231337 |
11 | 50665732229 |
12 | 214a9251521 |
13 | c493b068aa |
14 | 64b9668345 |
15 | 3624742ec7 |
hex | 1e862ec6a9 |
131100231337 has 2 divisors, whose sum is σ = 131100231338. Its totient is φ = 131100231336.
The previous prime is 131100231319. The next prime is 131100231343. The reversal of 131100231337 is 733132001131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 126704673936 + 4395557401 = 355956^2 + 66299^2 .
It is a cyclic number.
It is not a de Polignac number, because 131100231337 - 223 = 131091842729 is a prime.
It is a super-2 number, since 2×1311002313372 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131100231307) 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 as a sum of consecutive naturals, namely, 65550115668 + 65550115669.
It is an arithmetic number, because the mean of its divisors is an integer number (65550115669).
Almost surely, 2131100231337 is an apocalyptic number.
It is an amenable number.
131100231337 is a deficient number, since it is larger than the sum of its proper divisors (1).
131100231337 is an equidigital number, since it uses as much as digits as its factorization.
131100231337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 25.
Adding to 131100231337 its reverse (733132001131), we get a palindrome (864232232468).
The spelling of 131100231337 in words is "one hundred thirty-one billion, one hundred million, two hundred thirty-one thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •