Base | Representation |
---|---|
bin | 11000011111000001… |
… | …01010101010101101 |
3 | 1020221002212110110222 |
4 | 30033200222222231 |
5 | 203410122423001 |
6 | 10012213341125 |
7 | 643514464136 |
oct | 141740525255 |
9 | 36832773428 |
10 | 13145123501 |
11 | 5636096934 |
12 | 266a3377a5 |
13 | 13164840b3 |
14 | 8c9b44c8d |
15 | 51e06b61b |
hex | 30f82aaad |
13145123501 has 2 divisors, whose sum is σ = 13145123502. Its totient is φ = 13145123500.
The previous prime is 13145123449. The next prime is 13145123539. The reversal of 13145123501 is 10532154131.
13145123501 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11729106601 + 1416016900 = 108301^2 + 37630^2 .
It is a cyclic number.
It is not a de Polignac number, because 13145123501 - 226 = 13078014637 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13145123801) 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, 6572561750 + 6572561751.
It is an arithmetic number, because the mean of its divisors is an integer number (6572561751).
Almost surely, 213145123501 is an apocalyptic number.
It is an amenable number.
13145123501 is a deficient number, since it is larger than the sum of its proper divisors (1).
13145123501 is an equidigital number, since it uses as much as digits as its factorization.
13145123501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 13145123501 its reverse (10532154131), we get a palindrome (23677277632).
The spelling of 13145123501 in words is "thirteen billion, one hundred forty-five million, one hundred twenty-three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •