Base | Representation |
---|---|
bin | 111110111000010001… |
… | …1001010011011010001 |
3 | 110220112122000010202201 |
4 | 1331300203022123101 |
5 | 4203021224031423 |
6 | 142011041443201 |
7 | 12520140130213 |
oct | 1756043123321 |
9 | 426478003681 |
10 | 135032252113 |
11 | 522a3205680 |
12 | 22206040501 |
13 | c96c6164c5 |
14 | 676d9645b3 |
15 | 37a4a3b2ad |
hex | 1f708ca6d1 |
135032252113 has 8 divisors (see below), whose sum is σ = 147718244160. Its totient is φ = 122414648880.
The previous prime is 135032252111. The next prime is 135032252129. The reversal of 135032252113 is 311252230531.
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 135032252113 - 21 = 135032252111 is a prime.
It is a super-2 number, since 2×1350322521132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135032252111) 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, 17093070 + ... + 17100967.
It is an arithmetic number, because the mean of its divisors is an integer number (18464780520).
Almost surely, 2135032252113 is an apocalyptic number.
It is an amenable number.
135032252113 is a deficient number, since it is larger than the sum of its proper divisors (12685992047).
135032252113 is a wasteful number, since it uses less digits than its factorization.
135032252113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34194407.
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 135032252113 its reverse (311252230531), we get a palindrome (446284482644).
The spelling of 135032252113 in words is "one hundred thirty-five billion, thirty-two million, two hundred fifty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •