Base | Representation |
---|---|
bin | 111110101100111100… |
… | …1110110000011011101 |
3 | 110212120011002200122112 |
4 | 1331121321312003131 |
5 | 4201231443301023 |
6 | 141505230323405 |
7 | 12504544565246 |
oct | 1753171660335 |
9 | 425504080575 |
10 | 134652322013 |
11 | 521187a8560 |
12 | 2211a959565 |
13 | c90b9b10b1 |
14 | 6735305ccd |
15 | 37814de478 |
hex | 1f59e760dd |
134652322013 has 4 divisors (see below), whose sum is σ = 146893442208. Its totient is φ = 122411201820.
The previous prime is 134652321949. The next prime is 134652322031. The reversal of 134652322013 is 310223256431.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 134652322013 - 26 = 134652321949 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 (134652322513) 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, 6120560081 + ... + 6120560102.
It is an arithmetic number, because the mean of its divisors is an integer number (36723360552).
Almost surely, 2134652322013 is an apocalyptic number.
It is an amenable number.
134652322013 is a deficient number, since it is larger than the sum of its proper divisors (12241120195).
134652322013 is a wasteful number, since it uses less digits than its factorization.
134652322013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12241120194.
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 134652322013 its reverse (310223256431), we get a palindrome (444875578444).
The spelling of 134652322013 in words is "one hundred thirty-four billion, six hundred fifty-two million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •