Base | Representation |
---|---|
bin | 110000000001100011… |
… | …0000011000101100011 |
3 | 100212012101102100020011 |
4 | 1200003012003011203 |
5 | 3142203032213014 |
6 | 115213334025351 |
7 | 10310454105661 |
oct | 1400306030543 |
9 | 325171370204 |
10 | 103131132259 |
11 | 3a812921111 |
12 | 17ba24a8257 |
13 | 9957417c1c |
14 | 4dc4c3dc31 |
15 | 2a390827c4 |
hex | 1803183163 |
103131132259 has 2 divisors, whose sum is σ = 103131132260. Its totient is φ = 103131132258.
The previous prime is 103131132211. The next prime is 103131132271. The reversal of 103131132259 is 952231131301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103131132259 - 27 = 103131132131 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103131132259.
It is not a weakly prime, because it can be changed into another prime (103131132359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51565566129 + 51565566130.
It is an arithmetic number, because the mean of its divisors is an integer number (51565566130).
Almost surely, 2103131132259 is an apocalyptic number.
103131132259 is a deficient number, since it is larger than the sum of its proper divisors (1).
103131132259 is an equidigital number, since it uses as much as digits as its factorization.
103131132259 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 31.
The spelling of 103131132259 in words is "one hundred three billion, one hundred thirty-one million, one hundred thirty-two thousand, two hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •