Base | Representation |
---|---|
bin | 10000001010111… |
… | …00111011001001 |
3 | 100110020120121001 |
4 | 20011130323021 |
5 | 234211200141 |
6 | 21243215001 |
7 | 3234660034 |
oct | 1005347311 |
9 | 313216531 |
10 | 135646921 |
11 | 6a6295a3 |
12 | 39517461 |
13 | 22144b67 |
14 | 1403001b |
15 | bd96a31 |
hex | 815cec9 |
135646921 has 8 divisors (see below), whose sum is σ = 141224264. Its totient is φ = 130170240.
The previous prime is 135646883. The next prime is 135646937. The reversal of 135646921 is 129646531.
It can be written as a sum of positive squares in 4 ways, for example, as 26214400 + 109432521 = 5120^2 + 10461^2 .
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 135646921 - 213 = 135638729 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is not an unprimeable number, because it can be changed into a prime (135641921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22410 + ... + 27811.
It is an arithmetic number, because the mean of its divisors is an integer number (17653033).
Almost surely, 2135646921 is an apocalyptic number.
135646921 is the 8236-th centered square number.
It is an amenable number.
135646921 is a deficient number, since it is larger than the sum of its proper divisors (5577343).
135646921 is an equidigital number, since it uses as much as digits as its factorization.
135646921 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50331.
The product of its digits is 38880, while the sum is 37.
The square root of 135646921 is about 11646.7558143888. The cubic root of 135646921 is about 513.8109003251.
The spelling of 135646921 in words is "one hundred thirty-five million, six hundred forty-six thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •