Base | Representation |
---|---|
bin | 111110111101101010… |
… | …1001111000100110011 |
3 | 110221000020101201201112 |
4 | 1331323111033010303 |
5 | 4203404031304030 |
6 | 142041023023535 |
7 | 12524464546622 |
oct | 1757325170463 |
9 | 427006351645 |
10 | 135213150515 |
11 | 52386331293 |
12 | 2225673abab |
13 | c99ac43291 |
14 | 67899b36b9 |
15 | 37b5870a95 |
hex | 1f7b54f133 |
135213150515 has 8 divisors (see below), whose sum is σ = 162269252880. Its totient is φ = 108161538912.
The previous prime is 135213150469. The next prime is 135213150517. The reversal of 135213150515 is 515051312531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 135213150515 - 26 = 135213150451 is a prime.
It is not an unprimeable number, because it can be changed into a prime (135213150517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1056089 + ... + 1177178.
It is an arithmetic number, because the mean of its divisors is an integer number (20283656610).
Almost surely, 2135213150515 is an apocalyptic number.
135213150515 is a deficient number, since it is larger than the sum of its proper divisors (27056102365).
135213150515 is a wasteful number, since it uses less digits than its factorization.
135213150515 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2245381.
The product of its (nonzero) digits is 11250, while the sum is 32.
The spelling of 135213150515 in words is "one hundred thirty-five billion, two hundred thirteen million, one hundred fifty thousand, five hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •