Base | Representation |
---|---|
bin | 10000000001110… |
… | …11110000100101 |
3 | 100101000101212122 |
4 | 20000323300211 |
5 | 233410300001 |
6 | 21201555325 |
7 | 3221624645 |
oct | 1000736045 |
9 | 311011778 |
10 | 134462501 |
11 | 6999a738 |
12 | 39045b45 |
13 | 21b1ba14 |
14 | 13c02525 |
15 | bc10b1b |
hex | 803bc25 |
134462501 has 4 divisors (see below), whose sum is σ = 136469472. Its totient is φ = 132455532.
The previous prime is 134462453. The next prime is 134462507. The reversal of 134462501 is 105264431.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 105264431 = 569 ⋅184999.
It is a cyclic number.
It is not a de Polignac number, because 134462501 - 26 = 134462437 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134462507) 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 3 ways as a sum of consecutive naturals, for example, 1003385 + ... + 1003518.
It is an arithmetic number, because the mean of its divisors is an integer number (34117368).
Almost surely, 2134462501 is an apocalyptic number.
It is an amenable number.
134462501 is a deficient number, since it is larger than the sum of its proper divisors (2006971).
134462501 is an equidigital number, since it uses as much as digits as its factorization.
134462501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2006970.
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 134462501 is about 11595.7966953547. The cubic root of 134462501 is about 512.3110559502.
The spelling of 134462501 in words is "one hundred thirty-four million, four hundred sixty-two thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •