Base | Representation |
---|---|
bin | 10000001010111… |
… | …01111011010101 |
3 | 100110020210020012 |
4 | 20011131323111 |
5 | 234211313104 |
6 | 21243250005 |
7 | 3235005023 |
oct | 1005357325 |
9 | 313223205 |
10 | 135651029 |
11 | 6a631698 |
12 | 39519905 |
13 | 221469a7 |
14 | 14031713 |
15 | bd97d6e |
hex | 815ded5 |
135651029 has 4 divisors (see below), whose sum is σ = 135689376. Its totient is φ = 135612684.
The previous prime is 135651023. The next prime is 135651037. The reversal of 135651029 is 920156531.
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.
It is a cyclic number.
It is not a de Polignac number, because 135651029 - 28 = 135650773 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 135650986 and 135651004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135651023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13259 + ... + 21144.
It is an arithmetic number, because the mean of its divisors is an integer number (33922344).
Almost surely, 2135651029 is an apocalyptic number.
It is an amenable number.
135651029 is a deficient number, since it is larger than the sum of its proper divisors (38347).
135651029 is an equidigital number, since it uses as much as digits as its factorization.
135651029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38346.
The product of its (nonzero) digits is 8100, while the sum is 32.
The square root of 135651029 is about 11646.9321711771. The cubic root of 135651029 is about 513.8160871092.
The spelling of 135651029 in words is "one hundred thirty-five million, six hundred fifty-one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •