Base | Representation |
---|---|
bin | 10000010010110… |
… | …01110100010111 |
3 | 100112012012112000 |
4 | 20021121310113 |
5 | 234442322100 |
6 | 21321330343 |
7 | 3246533025 |
oct | 1011316427 |
9 | 315165460 |
10 | 136682775 |
11 | 70176879 |
12 | 399369b3 |
13 | 224184a8 |
14 | 1421d715 |
15 | beed900 |
hex | 8259d17 |
136682775 has 24 divisors (see below), whose sum is σ = 251092560. Its totient is φ = 72897120.
The previous prime is 136682701. The next prime is 136682779. The reversal of 136682775 is 577286631.
It is not a de Polignac number, because 136682775 - 27 = 136682647 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 136682775.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136682779) 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, 100572 + ... + 101921.
It is an arithmetic number, because the mean of its divisors is an integer number (10462190).
Almost surely, 2136682775 is an apocalyptic number.
136682775 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
136682775 is a deficient number, since it is larger than the sum of its proper divisors (114409785).
136682775 is a wasteful number, since it uses less digits than its factorization.
136682775 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202512 (or 202501 counting only the distinct ones).
The product of its digits is 423360, while the sum is 45.
The square root of 136682775 is about 11691.1408767494. The cubic root of 136682775 is about 515.1154735253.
The spelling of 136682775 in words is "one hundred thirty-six million, six hundred eighty-two thousand, seven hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •