Base | Representation |
---|---|
bin | 111110101011011101… |
… | …1101001000001111011 |
3 | 110212102200021111121201 |
4 | 1331112323221001323 |
5 | 4201131212230212 |
6 | 141500245515031 |
7 | 12503401020616 |
oct | 1752673510173 |
9 | 425380244551 |
10 | 134602461307 |
11 | 520a2642466 |
12 | 22106112a77 |
13 | c901574212 |
14 | 672c84717d |
15 | 377be40b57 |
hex | 1f56ee907b |
134602461307 has 4 divisors (see below), whose sum is σ = 139243925520. Its totient is φ = 129960997096.
The previous prime is 134602461299. The next prime is 134602461341. The reversal of 134602461307 is 703164206431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 703164206431 = 163 ⋅4313890837.
It is a cyclic number.
It is not a de Polignac number, because 134602461307 - 23 = 134602461299 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134602461397) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2320732063 + ... + 2320732120.
It is an arithmetic number, because the mean of its divisors is an integer number (34810981380).
Almost surely, 2134602461307 is an apocalyptic number.
134602461307 is a deficient number, since it is larger than the sum of its proper divisors (4641464213).
134602461307 is an equidigital number, since it uses as much as digits as its factorization.
134602461307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4641464212.
The product of its (nonzero) digits is 72576, while the sum is 37.
Adding to 134602461307 its reverse (703164206431), we get a palindrome (837766667738).
The spelling of 134602461307 in words is "one hundred thirty-four billion, six hundred two million, four hundred sixty-one thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •