Base | Representation |
---|---|
bin | 10000001010101… |
… | …10011111111100 |
3 | 100110012020111100 |
4 | 20011112133330 |
5 | 234204324404 |
6 | 21242453100 |
7 | 3234520230 |
oct | 1005263774 |
9 | 313166440 |
10 | 135620604 |
11 | 6a610849 |
12 | 39504190 |
13 | 22135ba2 |
14 | 140245c0 |
15 | bd8dd39 |
hex | 81567fc |
135620604 has 72 divisors (see below), whose sum is σ = 408844800. Its totient is φ = 37062432.
The previous prime is 135620599. The next prime is 135620609. The reversal of 135620604 is 406026531.
135620604 is a `hidden beast` number, since 1 + 3 + 56 + 2 + 0 + 604 = 666.
It is an interprime number because it is at equal distance from previous prime (135620599) and next prime (135620609).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135620609) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5904 + ... + 17495.
It is an arithmetic number, because the mean of its divisors is an integer number (5678400).
Almost surely, 2135620604 is an apocalyptic number.
135620604 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
135620604 is an abundant number, since it is smaller than the sum of its proper divisors (273224196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135620604 is a wasteful number, since it uses less digits than its factorization.
135620604 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23439 (or 23434 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The square root of 135620604 is about 11645.6259599903. The cubic root of 135620604 is about 513.7776698472. Note that the first 3 decimals are identical.
The spelling of 135620604 in words is "one hundred thirty-five million, six hundred twenty thousand, six hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •