Base | Representation |
---|---|
bin | 10000001001000… |
… | …11011011101011 |
3 | 100102210121120100 |
4 | 20010203123223 |
5 | 234131131220 |
6 | 21234200443 |
7 | 3232656345 |
oct | 1004433353 |
9 | 312717510 |
10 | 135411435 |
11 | 6a488685 |
12 | 39423123 |
13 | 22091913 |
14 | 13dac295 |
15 | bd4bd90 |
hex | 81236eb |
135411435 has 24 divisors (see below), whose sum is σ = 236165904. Its totient is φ = 71772480.
The previous prime is 135411391. The next prime is 135411439. The reversal of 135411435 is 534114531.
It is a happy number.
It is not a de Polignac number, because 135411435 - 212 = 135407339 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135411399 and 135411408.
It is not an unprimeable number, because it can be changed into a prime (135411439) 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 23 ways as a sum of consecutive naturals, for example, 1896 + ... + 16565.
It is an arithmetic number, because the mean of its divisors is an integer number (9840246).
Almost surely, 2135411435 is an apocalyptic number.
135411435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
135411435 is a deficient number, since it is larger than the sum of its proper divisors (100754469).
135411435 is a wasteful number, since it uses less digits than its factorization.
135411435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18635 (or 18632 counting only the distinct ones).
The product of its digits is 3600, while the sum is 27.
The square root of 135411435 is about 11636.6419125107. The cubic root of 135411435 is about 513.5133991429.
Adding to 135411435 its reverse (534114531), we get a palindrome (669525966).
The spelling of 135411435 in words is "one hundred thirty-five million, four hundred eleven thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •