Base | Representation |
---|---|
bin | 111111000100101111… |
… | …0010111011010110011 |
3 | 110221121202212112010211 |
4 | 1332021132113122303 |
5 | 4204400302100021 |
6 | 142120340404551 |
7 | 12533405421166 |
oct | 1761136273263 |
9 | 427552775124 |
10 | 135450425011 |
11 | 52498263110 |
12 | 223020a6757 |
13 | ca0814b6a5 |
14 | 67ad2d9add |
15 | 37cb5de3e1 |
hex | 1f897976b3 |
135450425011 has 8 divisors (see below), whose sum is σ = 147766777200. Its totient is φ = 123134519040.
The previous prime is 135450424997. The next prime is 135450425053. The reversal of 135450425011 is 110524054531.
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 135450425011 - 229 = 134913554099 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135450425111) 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, 1040395 + ... + 1163323.
It is an arithmetic number, because the mean of its divisors is an integer number (18470847150).
Almost surely, 2135450425011 is an apocalyptic number.
135450425011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
135450425011 is a deficient number, since it is larger than the sum of its proper divisors (12316352189).
135450425011 is a wasteful number, since it uses less digits than its factorization.
135450425011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223109.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 135450425011 its reverse (110524054531), we get a palindrome (245974479542).
The spelling of 135450425011 in words is "one hundred thirty-five billion, four hundred fifty million, four hundred twenty-five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •