Base | Representation |
---|---|
bin | 111101000011011000… |
… | …1010110000100001011 |
3 | 110112102021210020021021 |
4 | 1322012301112010023 |
5 | 4122003141220014 |
6 | 140121532253311 |
7 | 12321013321114 |
oct | 1720661260413 |
9 | 415367706237 |
10 | 131110101259 |
11 | 50670263695 |
12 | 214b0611237 |
13 | c495b81197 |
14 | 64baab720b |
15 | 3625542624 |
hex | 1e86c5610b |
131110101259 has 2 divisors, whose sum is σ = 131110101260. Its totient is φ = 131110101258.
The previous prime is 131110101257. The next prime is 131110101263. The reversal of 131110101259 is 952101011131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131110101259 - 21 = 131110101257 is a prime.
Together with 131110101257, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (131110101257) 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, 65555050629 + 65555050630.
It is an arithmetic number, because the mean of its divisors is an integer number (65555050630).
Almost surely, 2131110101259 is an apocalyptic number.
131110101259 is a deficient number, since it is larger than the sum of its proper divisors (1).
131110101259 is an equidigital number, since it uses as much as digits as its factorization.
131110101259 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 25.
The spelling of 131110101259 in words is "one hundred thirty-one billion, one hundred ten million, one hundred one thousand, two hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •