Base | Representation |
---|---|
bin | 11000011010000000… |
… | …01111111110110111 |
3 | 1020211011201222111211 |
4 | 30031000033332313 |
5 | 203313341234114 |
6 | 10004112142251 |
7 | 642464160433 |
oct | 141500177667 |
9 | 36734658454 |
10 | 13103071159 |
11 | 5614384332 |
12 | 2658237987 |
13 | 130a84c359 |
14 | 8c43199c3 |
15 | 51a5116c4 |
hex | 30d00ffb7 |
13103071159 has 2 divisors, whose sum is σ = 13103071160. Its totient is φ = 13103071158.
The previous prime is 13103071153. The next prime is 13103071193. The reversal of 13103071159 is 95117030131.
It is a weak prime.
It is an emirp because it is prime and its reverse (95117030131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13103071159 - 23 = 13103071151 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13103071159.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13103071151) 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, 6551535579 + 6551535580.
It is an arithmetic number, because the mean of its divisors is an integer number (6551535580).
Almost surely, 213103071159 is an apocalyptic number.
13103071159 is a deficient number, since it is larger than the sum of its proper divisors (1).
13103071159 is an equidigital number, since it uses as much as digits as its factorization.
13103071159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2835, while the sum is 31.
The spelling of 13103071159 in words is "thirteen billion, one hundred three million, seventy-one thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •