Base | Representation |
---|---|
bin | 10000000010100… |
… | …01110110110111 |
3 | 100101012000001000 |
4 | 20001101312313 |
5 | 233421144030 |
6 | 21203534343 |
7 | 3222452562 |
oct | 1001216667 |
9 | 311160030 |
10 | 134553015 |
11 | 69a51743 |
12 | 3908a3b3 |
13 | 21b50c8c |
14 | 13c274d9 |
15 | bc2c860 |
hex | 8051db7 |
134553015 has 16 divisors (see below), whose sum is σ = 239205600. Its totient is φ = 71761536.
The previous prime is 134552987. The next prime is 134553017. The reversal of 134553015 is 510355431.
It is not a de Polignac number, because 134553015 - 25 = 134552983 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 134553015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134553017) 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 15 ways as a sum of consecutive naturals, for example, 498210 + ... + 498479.
It is an arithmetic number, because the mean of its divisors is an integer number (14950350).
Almost surely, 2134553015 is an apocalyptic number.
134553015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
134553015 is a deficient number, since it is larger than the sum of its proper divisors (104652585).
134553015 is an equidigital number, since it uses as much as digits as its factorization.
134553015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 996703 (or 996697 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
The square root of 134553015 is about 11599.6989185065. The cubic root of 134553015 is about 512.4259849488.
The spelling of 134553015 in words is "one hundred thirty-four million, five hundred fifty-three thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •