Base | Representation |
---|---|
bin | 10000001001110… |
… | …01111000000101 |
3 | 100102222021200011 |
4 | 20010321320011 |
5 | 234142101430 |
6 | 21240150221 |
7 | 3233521354 |
oct | 1004717005 |
9 | 312867604 |
10 | 135503365 |
11 | 6a540758 |
12 | 39468371 |
13 | 220c470a |
14 | 13dd399b |
15 | bd6922a |
hex | 8139e05 |
135503365 has 8 divisors (see below), whose sum is σ = 162667008. Its totient is φ = 108360720.
The previous prime is 135503359. The next prime is 135503369. The reversal of 135503365 is 563305531.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 135503365 - 221 = 133406213 is a prime.
It is a super-2 number, since 2×1355033652 = 36722323852646450, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135503369) 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 in 7 ways as a sum of consecutive naturals, for example, 20004 + ... + 25906.
It is an arithmetic number, because the mean of its divisors is an integer number (20333376).
Almost surely, 2135503365 is an apocalyptic number.
It is an amenable number.
135503365 is a deficient number, since it is larger than the sum of its proper divisors (27163643).
135503365 is an equidigital number, since it uses as much as digits as its factorization.
135503365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10499.
The product of its (nonzero) digits is 20250, while the sum is 31.
The square root of 135503365 is about 11640.5912650518. The cubic root of 135503365 is about 513.6295798970.
Adding to 135503365 its reverse (563305531), we get a palindrome (698808896).
The spelling of 135503365 in words is "one hundred thirty-five million, five hundred three thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •