Base | Representation |
---|---|
bin | 10000000001111… |
… | …00111000000001 |
3 | 100101000122010222 |
4 | 20000330320001 |
5 | 233410421243 |
6 | 21202032425 |
7 | 3221644166 |
oct | 1000747001 |
9 | 311018128 |
10 | 134467073 |
11 | 699a3114 |
12 | 39048715 |
13 | 21b20b20 |
14 | 13c0406d |
15 | bc12168 |
hex | 803ce01 |
134467073 has 4 divisors (see below), whose sum is σ = 144810708. Its totient is φ = 124123440.
The previous prime is 134467061. The next prime is 134467097. The reversal of 134467073 is 370764431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 370764431 = 173 ⋅2143147.
It can be written as a sum of positive squares in 2 ways, for example, as 89737729 + 44729344 = 9473^2 + 6688^2 .
It is a cyclic number.
It is not a de Polignac number, because 134467073 - 28 = 134466817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134467043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5171798 + ... + 5171823.
It is an arithmetic number, because the mean of its divisors is an integer number (36202677).
Almost surely, 2134467073 is an apocalyptic number.
134467073 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
134467073 is a deficient number, since it is larger than the sum of its proper divisors (10343635).
134467073 is a wasteful number, since it uses less digits than its factorization.
134467073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10343634.
The product of its (nonzero) digits is 42336, while the sum is 35.
The square root of 134467073 is about 11595.9938340791. The cubic root of 134467073 is about 512.3168624255.
The spelling of 134467073 in words is "one hundred thirty-four million, four hundred sixty-seven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •