Base | Representation |
---|---|
bin | 10000000010001… |
… | …00111101110111 |
3 | 100101002022121110 |
4 | 20001010331313 |
5 | 233413001330 |
6 | 21202450103 |
7 | 3222142623 |
oct | 1001047567 |
9 | 311068543 |
10 | 134500215 |
11 | 69a16003 |
12 | 39063933 |
13 | 21b32c35 |
14 | 13c12183 |
15 | bc1bdb0 |
hex | 8044f77 |
134500215 has 8 divisors (see below), whose sum is σ = 215200368. Its totient is φ = 71733440.
The previous prime is 134500211. The next prime is 134500241. The reversal of 134500215 is 512005431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 134500215 - 22 = 134500211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 134500191 and 134500200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134500211) 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 7 ways as a sum of consecutive naturals, for example, 4483326 + ... + 4483355.
It is an arithmetic number, because the mean of its divisors is an integer number (26900046).
Almost surely, 2134500215 is an apocalyptic number.
134500215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
134500215 is a deficient number, since it is larger than the sum of its proper divisors (80700153).
134500215 is an equidigital number, since it uses as much as digits as its factorization.
134500215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8966689.
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 134500215 is about 11597.4227740477. The cubic root of 134500215 is about 512.3589490874.
Adding to 134500215 its reverse (512005431), we get a palindrome (646505646).
The spelling of 134500215 in words is "one hundred thirty-four million, five hundred thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •