Base | Representation |
---|---|
bin | 10000000110001… |
… | …00001000000101 |
3 | 100102001210002001 |
4 | 20003010020011 |
5 | 234031133221 |
6 | 21221545301 |
7 | 3226442260 |
oct | 1003041005 |
9 | 312053061 |
10 | 135021061 |
11 | 6a24135a |
12 | 39275231 |
13 | 21c86026 |
14 | 13d09cd7 |
15 | bcc1391 |
hex | 80c4205 |
135021061 has 4 divisors (see below), whose sum is σ = 154309792. Its totient is φ = 115732332.
The previous prime is 135021043. The next prime is 135021067. The reversal of 135021061 is 160120531.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 160120531 = 137 ⋅1168763.
It is a cyclic number.
It is not a de Polignac number, because 135021061 - 211 = 135019013 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135021067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9644355 + ... + 9644368.
It is an arithmetic number, because the mean of its divisors is an integer number (38577448).
Almost surely, 2135021061 is an apocalyptic number.
It is an amenable number.
135021061 is a deficient number, since it is larger than the sum of its proper divisors (19288731).
135021061 is an equidigital number, since it uses as much as digits as its factorization.
135021061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19288730.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 135021061 is about 11619.8563244130. The cubic root of 135021061 is about 513.0194595073.
Adding to 135021061 its reverse (160120531), we get a palindrome (295141592).
The spelling of 135021061 in words is "one hundred thirty-five million, twenty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •