Base | Representation |
---|---|
bin | 1000011100111100111… |
… | …0000110111110111101 |
3 | 111212210222011212021112 |
4 | 2013033032012332331 |
5 | 4334342342044401 |
6 | 150413033011405 |
7 | 13330310624306 |
oct | 2071716067675 |
9 | 455728155245 |
10 | 145210503101 |
11 | 566465a8254 |
12 | 24186853b65 |
13 | 10902214721 |
14 | 70576477ad |
15 | 3b9d3a93bb |
hex | 21cf386fbd |
145210503101 has 2 divisors, whose sum is σ = 145210503102. Its totient is φ = 145210503100.
The previous prime is 145210503073. The next prime is 145210503107. The reversal of 145210503101 is 101305012541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100711022500 + 44499480601 = 317350^2 + 210949^2 .
It is an emirp because it is prime and its reverse (101305012541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145210503101 - 234 = 128030633917 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145210503107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72605251550 + 72605251551.
It is an arithmetic number, because the mean of its divisors is an integer number (72605251551).
Almost surely, 2145210503101 is an apocalyptic number.
It is an amenable number.
145210503101 is a deficient number, since it is larger than the sum of its proper divisors (1).
145210503101 is an equidigital number, since it uses as much as digits as its factorization.
145210503101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 600, while the sum is 23.
Adding to 145210503101 its reverse (101305012541), we get a palindrome (246515515642).
The spelling of 145210503101 in words is "one hundred forty-five billion, two hundred ten million, five hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •