Base | Representation |
---|---|
bin | 111110111000100111… |
… | …0000111101011001001 |
3 | 110220120102012020211211 |
4 | 1331301032013223021 |
5 | 4203032114404113 |
6 | 142012123053121 |
7 | 12520334630662 |
oct | 1756116075311 |
9 | 426512166754 |
10 | 135043513033 |
11 | 522a95a7120 |
12 | 222099711a1 |
13 | c971a59c80 |
14 | 6771256369 |
15 | 37a5a12b3d |
hex | 1f71387ac9 |
135043513033 has 8 divisors (see below), whose sum is σ = 158652518976. Its totient is φ = 113323227600.
The previous prime is 135043513009. The next prime is 135043513043. The reversal of 135043513033 is 330315340531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-135043513033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 135043512986 and 135043513004.
It is not an unprimeable number, because it can be changed into a prime (135043513043) 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, 472179973 + ... + 472180258.
It is an arithmetic number, because the mean of its divisors is an integer number (19831564872).
Almost surely, 2135043513033 is an apocalyptic number.
135043513033 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
135043513033 is a deficient number, since it is larger than the sum of its proper divisors (23609005943).
135043513033 is a wasteful number, since it uses less digits than its factorization.
135043513033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 944360255.
The product of its (nonzero) digits is 24300, while the sum is 31.
Adding to 135043513033 its reverse (330315340531), we get a palindrome (465358853564).
The spelling of 135043513033 in words is "one hundred thirty-five billion, forty-three million, five hundred thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •