Base | Representation |
---|---|
bin | 111110101001011101… |
… | …0111011010001100111 |
3 | 110212020222122111111001 |
4 | 1331102322323101213 |
5 | 4201012000240111 |
6 | 141445443254131 |
7 | 12501623014561 |
oct | 1752272732147 |
9 | 425228574431 |
10 | 134535165031 |
11 | 52068658803 |
12 | 220a767a347 |
13 | c8c0641237 |
14 | 672392a331 |
15 | 377609b1c1 |
hex | 1f52ebb467 |
134535165031 has 4 divisors (see below), whose sum is σ = 134710114000. Its totient is φ = 134360216064.
The previous prime is 134535165019. The next prime is 134535165041. The reversal of 134535165031 is 130561535431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 130561535431 = 23 ⋅5676588497.
It is a cyclic number.
It is not a de Polignac number, because 134535165031 - 25 = 134535164999 is a prime.
It is a super-2 number, since 2×1345351650312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134535165041) 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, 87473331 + ... + 87474868.
It is an arithmetic number, because the mean of its divisors is an integer number (33677528500).
Almost surely, 2134535165031 is an apocalyptic number.
134535165031 is a deficient number, since it is larger than the sum of its proper divisors (174948969).
134535165031 is an equidigital number, since it uses as much as digits as its factorization.
134535165031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174948968.
The product of its (nonzero) digits is 81000, while the sum is 37.
The spelling of 134535165031 in words is "one hundred thirty-four billion, five hundred thirty-five million, one hundred sixty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •