Base | Representation |
---|---|
bin | 10000000110010… |
… | …11011110000001 |
3 | 100102010022022222 |
4 | 20003023132001 |
5 | 234033114022 |
6 | 21222340425 |
7 | 3226626044 |
oct | 1003133601 |
9 | 312108288 |
10 | 135051137 |
11 | 6a261a11 |
12 | 3928a715 |
13 | 21c96920 |
14 | 13d16c5b |
15 | bcca242 |
hex | 80cb781 |
135051137 has 4 divisors (see below), whose sum is σ = 145439700. Its totient is φ = 124662576.
The previous prime is 135051131. The next prime is 135051157. The reversal of 135051137 is 731150531.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 731150531 = 31 ⋅23585501.
It can be written as a sum of positive squares in 2 ways, for example, as 37258816 + 97792321 = 6104^2 + 9889^2 .
It is a cyclic number.
It is not a de Polignac number, because 135051137 - 222 = 130856833 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135051131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5194262 + ... + 5194287.
It is an arithmetic number, because the mean of its divisors is an integer number (36359925).
Almost surely, 2135051137 is an apocalyptic number.
It is an amenable number.
135051137 is a deficient number, since it is larger than the sum of its proper divisors (10388563).
135051137 is a wasteful number, since it uses less digits than its factorization.
135051137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10388562.
The product of its (nonzero) digits is 1575, while the sum is 26.
The square root of 135051137 is about 11621.1504163744. The cubic root of 135051137 is about 513.0575484485.
The spelling of 135051137 in words is "one hundred thirty-five million, fifty-one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •