Base | Representation |
---|---|
bin | 111110110111111111… |
… | …0100011011111100111 |
3 | 110220111221221120122020 |
4 | 1331233332203133213 |
5 | 4203011244433323 |
6 | 142010100034223 |
7 | 12516662430513 |
oct | 1755776433747 |
9 | 426457846566 |
10 | 135022655463 |
11 | 52298850563 |
12 | 22202992973 |
13 | c96a636407 |
14 | 676c587143 |
15 | 37a3c92ae3 |
hex | 1f6ffa37e7 |
135022655463 has 4 divisors (see below), whose sum is σ = 180030207288. Its totient is φ = 90015103640.
The previous prime is 135022655419. The next prime is 135022655489. The reversal of 135022655463 is 364556220531.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 364556220531 = 3 ⋅121518740177.
It is a cyclic number.
It is not a de Polignac number, because 135022655463 - 217 = 135022524391 is a prime.
It is a super-2 number, since 2×1350226554632 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135022655413) 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, 22503775908 + ... + 22503775913.
It is an arithmetic number, because the mean of its divisors is an integer number (45007551822).
Almost surely, 2135022655463 is an apocalyptic number.
135022655463 is a deficient number, since it is larger than the sum of its proper divisors (45007551825).
135022655463 is an equidigital number, since it uses as much as digits as its factorization.
135022655463 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45007551824.
The product of its (nonzero) digits is 648000, while the sum is 42.
Adding to 135022655463 its reverse (364556220531), we get a palindrome (499578875994).
The spelling of 135022655463 in words is "one hundred thirty-five billion, twenty-two million, six hundred fifty-five thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •