Base | Representation |
---|---|
bin | 111101000011100000… |
… | …1001100001111000011 |
3 | 110112102120121021112121 |
4 | 1322013001030033003 |
5 | 4122010222132144 |
6 | 140122201305111 |
7 | 12321063532036 |
oct | 1720701141703 |
9 | 415376537477 |
10 | 131114255299 |
11 | 50672640685 |
12 | 214b1a95197 |
13 | c4969a6bb1 |
14 | 64bb47901d |
15 | 3625ab3384 |
hex | 1e8704c3c3 |
131114255299 has 2 divisors, whose sum is σ = 131114255300. Its totient is φ = 131114255298.
The previous prime is 131114255287. The next prime is 131114255323. The reversal of 131114255299 is 992552411131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131114255299 - 29 = 131114254787 is a prime.
It is a super-2 number, since 2×1311142552992 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131114255219) 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, 65557127649 + 65557127650.
It is an arithmetic number, because the mean of its divisors is an integer number (65557127650).
Almost surely, 2131114255299 is an apocalyptic number.
131114255299 is a deficient number, since it is larger than the sum of its proper divisors (1).
131114255299 is an equidigital number, since it uses as much as digits as its factorization.
131114255299 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 97200, while the sum is 43.
The spelling of 131114255299 in words is "one hundred thirty-one billion, one hundred fourteen million, two hundred fifty-five thousand, two hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •