Base | Representation |
---|---|
bin | 111111000000101101… |
… | …0010110000100111101 |
3 | 110221021100100000010020 |
4 | 1332001122112010331 |
5 | 4204111134400323 |
6 | 142055105202353 |
7 | 12530143552602 |
oct | 1760132260475 |
9 | 427240300106 |
10 | 135315153213 |
11 | 52428970439 |
12 | 222849303b9 |
13 | c9b61084c6 |
14 | 67993666a9 |
15 | 37be7bdae3 |
hex | 1f8169613d |
135315153213 has 8 divisors (see below), whose sum is σ = 188264561088. Its totient is φ = 86287923744.
The previous prime is 135315153199. The next prime is 135315153223. The reversal of 135315153213 is 312351513531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 135315153213 - 232 = 131020185917 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135315153223) 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 7 ways as a sum of consecutive naturals, for example, 980544520 + ... + 980544657.
It is an arithmetic number, because the mean of its divisors is an integer number (23533070136).
Almost surely, 2135315153213 is an apocalyptic number.
It is an amenable number.
135315153213 is a deficient number, since it is larger than the sum of its proper divisors (52949407875).
135315153213 is a wasteful number, since it uses less digits than its factorization.
135315153213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1961089203.
The product of its digits is 20250, while the sum is 33.
Adding to 135315153213 its reverse (312351513531), we get a palindrome (447666666744).
The spelling of 135315153213 in words is "one hundred thirty-five billion, three hundred fifteen million, one hundred fifty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •