Base | Representation |
---|---|
bin | 111111000101001010… |
… | …0001001111000100111 |
3 | 110221122202101220011122 |
4 | 1332022110021320213 |
5 | 4204412404302401 |
6 | 142122002524155 |
7 | 12533636316101 |
oct | 1761224117047 |
9 | 427582356148 |
10 | 135464525351 |
11 | 524a5213991 |
12 | 2230696665b |
13 | ca0b04769c |
14 | 67b112a571 |
15 | 37cc97721b |
hex | 1f8a509e27 |
135464525351 has 4 divisors (see below), whose sum is σ = 135465282792. Its totient is φ = 135463767912.
The previous prime is 135464525323. The next prime is 135464525377. The reversal of 135464525351 is 153525464531.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135464525351 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 (135464525851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55496 + ... + 523458.
It is an arithmetic number, because the mean of its divisors is an integer number (33866320698).
Almost surely, 2135464525351 is an apocalyptic number.
135464525351 is a deficient number, since it is larger than the sum of its proper divisors (757441).
135464525351 is an equidigital number, since it uses as much as digits as its factorization.
135464525351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 757440.
The product of its digits is 1080000, while the sum is 44.
Adding to 135464525351 its reverse (153525464531), we get a palindrome (288989989882).
The spelling of 135464525351 in words is "one hundred thirty-five billion, four hundred sixty-four million, five hundred twenty-five thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •