Base | Representation |
---|---|
bin | 11110110000010001001011… |
… | …010000111110011111101111 |
3 | 122201220120111120011221212101 |
4 | 132300101023100332133233 |
5 | 120212033121420431434 |
6 | 1155400501052515531 |
7 | 40330044366233233 |
oct | 3660211320763757 |
9 | 581816446157771 |
10 | 135258372827119 |
11 | 3a108832311973 |
12 | 13205b8b47bba7 |
13 | 5a61a6b2677b9 |
14 | 255877c3505c3 |
15 | 10985a9bc6b14 |
hex | 7b044b43e7ef |
135258372827119 has 8 divisors (see below), whose sum is σ = 138086590806000. Its totient is φ = 132440383485696.
The previous prime is 135258372827051. The next prime is 135258372827131. The reversal of 135258372827119 is 911728273852531.
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 135258372827119 - 217 = 135258372696047 is a prime.
It is a super-2 number, since 2×1352583728271192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135258372827189) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2557132642 + ... + 2557185535.
It is an arithmetic number, because the mean of its divisors is an integer number (17260823850750).
Almost surely, 2135258372827119 is an apocalyptic number.
135258372827119 is a deficient number, since it is larger than the sum of its proper divisors (2828217978881).
135258372827119 is an equidigital number, since it uses as much as digits as its factorization.
135258372827119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5114318729.
The product of its digits is 50803200, while the sum is 64.
The spelling of 135258372827119 in words is "one hundred thirty-five trillion, two hundred fifty-eight billion, three hundred seventy-two million, eight hundred twenty-seven thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •