Search a number
BaseRepresentation
bin11000001101110110…
…10011001010001111
31020120001212211022111
430012323103022033
5203111241011114
65550030524451
7640115420152
oct140673231217
936501784274
1013001110159
115571873544
12262a066727
1312c26a00bb
148b4977c99
155115c0bc4
hex306ed328f

13001110159 has 2 divisors, whose sum is σ = 13001110160. Its totient is φ = 13001110158.

The previous prime is 13001110099. The next prime is 13001110189. The reversal of 13001110159 is 95101110031.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 13001110159 - 217 = 13000979087 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (13001110189) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6500555079 + 6500555080.

It is an arithmetic number, because the mean of its divisors is an integer number (6500555080).

Almost surely, 213001110159 is an apocalyptic number.

13001110159 is a deficient number, since it is larger than the sum of its proper divisors (1).

13001110159 is an equidigital number, since it uses as much as digits as its factorization.

13001110159 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 135, while the sum is 22.

The spelling of 13001110159 in words is "thirteen billion, one million, one hundred ten thousand, one hundred fifty-nine".