Base | Representation |
---|---|
bin | 10000001010011… |
… | …01000111000110 |
3 | 100110010021202010 |
4 | 20011031013012 |
5 | 234202112100 |
6 | 21241555050 |
7 | 3234300144 |
oct | 1005150706 |
9 | 313107663 |
10 | 135582150 |
11 | 6a594970 |
12 | 394a5a86 |
13 | 22121532 |
14 | 14014594 |
15 | bd82750 |
hex | 814d1c6 |
135582150 has 48 divisors (see below), whose sum is σ = 366815808. Its totient is φ = 32868000.
The previous prime is 135582137. The next prime is 135582151. The reversal of 135582150 is 51285531.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135582151) 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 23 ways as a sum of consecutive naturals, for example, 39436 + ... + 42735.
It is an arithmetic number, because the mean of its divisors is an integer number (7641996).
Almost surely, 2135582150 is an apocalyptic number.
135582150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
135582150 is an abundant number, since it is smaller than the sum of its proper divisors (231233658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135582150 is a wasteful number, since it uses less digits than its factorization.
135582150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82197 (or 82192 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 30.
The square root of 135582150 is about 11643.9748367986. The cubic root of 135582150 is about 513.7291062477.
It can be divided in two parts, 135 and 582150, that added together give a palindrome (582285).
The spelling of 135582150 in words is "one hundred thirty-five million, five hundred eighty-two thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.214 sec. • engine limits •