Base | Representation |
---|---|
bin | 111110101000100000… |
… | …0010010001101100111 |
3 | 110212011202011010022012 |
4 | 1331101000102031213 |
5 | 4200430232442041 |
6 | 141442334224435 |
7 | 12501052523522 |
oct | 1752100221547 |
9 | 425152133265 |
10 | 134503015271 |
11 | 5205149a159 |
12 | 2209895511b |
13 | c8b6a95901 |
14 | 671d55bbb9 |
15 | 377334a3eb |
hex | 1f51012367 |
134503015271 has 2 divisors, whose sum is σ = 134503015272. Its totient is φ = 134503015270.
The previous prime is 134503015237. The next prime is 134503015289. The reversal of 134503015271 is 172510305431.
It is a strong prime.
It is an emirp because it is prime and its reverse (172510305431) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134503015271 is a prime.
It is a super-2 number, since 2×1345030152712 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134503015201) 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, 67251507635 + 67251507636.
It is an arithmetic number, because the mean of its divisors is an integer number (67251507636).
Almost surely, 2134503015271 is an apocalyptic number.
134503015271 is a deficient number, since it is larger than the sum of its proper divisors (1).
134503015271 is an equidigital number, since it uses as much as digits as its factorization.
134503015271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 32.
The spelling of 134503015271 in words is "one hundred thirty-four billion, five hundred three million, fifteen thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •