Base | Representation |
---|---|
bin | 111110101011100001… |
… | …1001000010101010011 |
3 | 110212102210222020122201 |
4 | 1331113003020111103 |
5 | 4201132213041111 |
6 | 141500355544031 |
7 | 12503423505403 |
oct | 1752703102523 |
9 | 425383866581 |
10 | 134604424531 |
11 | 520a3763465 |
12 | 221068bb017 |
13 | c901ab09a5 |
14 | 672cbd8803 |
15 | 377c1cc6c1 |
hex | 1f570c8553 |
134604424531 has 4 divisors (see below), whose sum is σ = 135167623200. Its totient is φ = 134041225864.
The previous prime is 134604424529. The next prime is 134604424561. The reversal of 134604424531 is 135424406431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 135424406431 = 4201 ⋅32236231.
It is a cyclic number.
It is not a de Polignac number, because 134604424531 - 21 = 134604424529 is a prime.
It is a super-2 number, since 2×1346044245312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134604424501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 281598976 + ... + 281599453.
It is an arithmetic number, because the mean of its divisors is an integer number (33791905800).
Almost surely, 2134604424531 is an apocalyptic number.
134604424531 is a deficient number, since it is larger than the sum of its proper divisors (563198669).
134604424531 is an equidigital number, since it uses as much as digits as its factorization.
134604424531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 563198668.
The product of its (nonzero) digits is 138240, while the sum is 37.
The spelling of 134604424531 in words is "one hundred thirty-four billion, six hundred four million, four hundred twenty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •