Base | Representation |
---|---|
bin | 10000001010100… |
… | …01011111101001 |
3 | 100110011012101010 |
4 | 20011101133221 |
5 | 234203200410 |
6 | 21242214133 |
7 | 3234403404 |
oct | 1005213751 |
9 | 313135333 |
10 | 135600105 |
11 | 6a5a7403 |
12 | 394b4349 |
13 | 22129764 |
14 | 1401ad3b |
15 | bd87c20 |
hex | 81517e9 |
135600105 has 8 divisors (see below), whose sum is σ = 216960192. Its totient is φ = 72320048.
The previous prime is 135600037. The next prime is 135600119. The reversal of 135600105 is 501006531.
It is a happy number.
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 135600105 - 27 = 135599977 is a prime.
It is a super-2 number, since 2×1356001052 = 36774776952022050, which contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
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, 4519989 + ... + 4520018.
It is an arithmetic number, because the mean of its divisors is an integer number (27120024).
Almost surely, 2135600105 is an apocalyptic number.
135600105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
135600105 is a deficient number, since it is larger than the sum of its proper divisors (81360087).
135600105 is an equidigital number, since it uses as much as digits as its factorization.
135600105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9040015.
The product of its (nonzero) digits is 450, while the sum is 21.
The square root of 135600105 is about 11644.7458108797. The cubic root of 135600105 is about 513.7517827798.
Adding to 135600105 its reverse (501006531), we get a palindrome (636606636).
The spelling of 135600105 in words is "one hundred thirty-five million, six hundred thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •