Base | Representation |
---|---|
bin | 11110110010111010010101… |
… | …000110100101001001111101 |
3 | 122202112221022111012122001102 |
4 | 132302322111012211021331 |
5 | 120223022110030223201 |
6 | 1200020135510422445 |
7 | 40346134315625066 |
oct | 3662722506451175 |
9 | 582487274178042 |
10 | 135440000242301 |
11 | 3a178866250177 |
12 | 1323521a061a25 |
13 | 5a75c250c33c1 |
14 | 256348c33956d |
15 | 109d18a1e726b |
hex | 7b2e951a527d |
135440000242301 has 2 divisors, whose sum is σ = 135440000242302. Its totient is φ = 135440000242300.
The previous prime is 135440000242291. The next prime is 135440000242343. The reversal of 135440000242301 is 103242000044531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 126229831392025 + 9210168850276 = 11235205^2 + 3034826^2 .
It is a cyclic number.
It is not a de Polignac number, because 135440000242301 - 214 = 135440000225917 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135440000242601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67720000121150 + 67720000121151.
It is an arithmetic number, because the mean of its divisors is an integer number (67720000121151).
Almost surely, 2135440000242301 is an apocalyptic number.
It is an amenable number.
135440000242301 is a deficient number, since it is larger than the sum of its proper divisors (1).
135440000242301 is an equidigital number, since it uses as much as digits as its factorization.
135440000242301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 135440000242301 its reverse (103242000044531), we get a palindrome (238682000286832).
The spelling of 135440000242301 in words is "one hundred thirty-five trillion, four hundred forty billion, two hundred forty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •