Base | Representation |
---|---|
bin | 10000000101100… |
… | …01100001011101 |
3 | 100101220220112211 |
4 | 20002301201131 |
5 | 234021213421 |
6 | 21220200421 |
7 | 3226004152 |
oct | 1002614135 |
9 | 311826484 |
10 | 134944861 |
11 | 6a19a087 |
12 | 39239111 |
13 | 21c5a43c |
14 | 13cca229 |
15 | bca89e1 |
hex | 80b185d |
134944861 has 4 divisors (see below), whose sum is σ = 142882812. Its totient is φ = 127006912.
The previous prime is 134944853. The next prime is 134944913. The reversal of 134944861 is 168449431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 168449431 = 7753 ⋅21727.
It can be written as a sum of positive squares in 2 ways, for example, as 123076836 + 11868025 = 11094^2 + 3445^2 .
It is a cyclic number.
It is not a de Polignac number, because 134944861 - 23 = 134944853 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 (134944811) 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, 3968950 + ... + 3968983.
It is an arithmetic number, because the mean of its divisors is an integer number (35720703).
Almost surely, 2134944861 is an apocalyptic number.
It is an amenable number.
134944861 is a deficient number, since it is larger than the sum of its proper divisors (7937951).
134944861 is an equidigital number, since it uses as much as digits as its factorization.
134944861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7937950.
The product of its digits is 82944, while the sum is 40.
The square root of 134944861 is about 11616.5769915238. The cubic root of 134944861 is about 512.9229327413.
The spelling of 134944861 in words is "one hundred thirty-four million, nine hundred forty-four thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •