Base | Representation |
---|---|
bin | 10000001100110… |
… | …10111100000001 |
3 | 100110201111000202 |
4 | 20012122330001 |
5 | 234242312204 |
6 | 21252454545 |
7 | 3240065423 |
oct | 1006327401 |
9 | 313644022 |
10 | 135900929 |
11 | 6a79241a |
12 | 3961a455 |
13 | 22203668 |
14 | 14098813 |
15 | bde6e1e |
hex | 819af01 |
135900929 has 2 divisors, whose sum is σ = 135900930. Its totient is φ = 135900928.
The previous prime is 135900911. The next prime is 135900943. The reversal of 135900929 is 929009531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110670400 + 25230529 = 10520^2 + 5023^2 .
It is a cyclic number.
It is not a de Polignac number, because 135900929 - 212 = 135896833 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135900892 and 135900901.
It is not a weakly prime, because it can be changed into another prime (135900959) 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 as a sum of consecutive naturals, namely, 67950464 + 67950465.
It is an arithmetic number, because the mean of its divisors is an integer number (67950465).
Almost surely, 2135900929 is an apocalyptic number.
It is an amenable number.
135900929 is a deficient number, since it is larger than the sum of its proper divisors (1).
135900929 is an equidigital number, since it uses as much as digits as its factorization.
135900929 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21870, while the sum is 38.
The square root of 135900929 is about 11657.6553817652. The cubic root of 135900929 is about 514.1314155240.
The spelling of 135900929 in words is "one hundred thirty-five million, nine hundred thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •