Base | Representation |
---|---|
bin | 111111000101000011… |
… | …1001101111011010101 |
3 | 110221122112000121011102 |
4 | 1332022013031323111 |
5 | 4204411022242122 |
6 | 142121402115445 |
7 | 12533565432635 |
oct | 1761207157325 |
9 | 427575017142 |
10 | 135461134037 |
11 | 524a3307a49 |
12 | 223057abb85 |
13 | ca0a42aba8 |
14 | 67b08c66c5 |
15 | 37cc507492 |
hex | 1f8a1cded5 |
135461134037 has 4 divisors (see below), whose sum is σ = 135464776320. Its totient is φ = 135457491756.
The previous prime is 135461134019. The next prime is 135461134079. The reversal of 135461134037 is 730431164531.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 730431164531 = 123551 ⋅5911981.
It is a cyclic number.
It is not a de Polignac number, because 135461134037 - 28 = 135461133781 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135461134097) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1764773 + ... + 1839930.
It is an arithmetic number, because the mean of its divisors is an integer number (33866194080).
Almost surely, 2135461134037 is an apocalyptic number.
It is an amenable number.
135461134037 is a deficient number, since it is larger than the sum of its proper divisors (3642283).
135461134037 is an equidigital number, since it uses as much as digits as its factorization.
135461134037 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3642282.
The product of its (nonzero) digits is 90720, while the sum is 38.
Adding to 135461134037 its reverse (730431164531), we get a palindrome (865892298568).
The spelling of 135461134037 in words is "one hundred thirty-five billion, four hundred sixty-one million, one hundred thirty-four thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •