Base | Representation |
---|---|
bin | 111110101101011000… |
… | …0100111011101000101 |
3 | 110212121011010011021202 |
4 | 1331122300213131011 |
5 | 4201244132231013 |
6 | 141510502152245 |
7 | 12505110615536 |
oct | 1753260473505 |
9 | 425534104252 |
10 | 134666680133 |
11 | 52125914a77 |
12 | 22123722685 |
13 | c91196a51b |
14 | 67371a268d |
15 | 37828c8858 |
hex | 1f5ac27745 |
134666680133 has 4 divisors (see below), whose sum is σ = 141754400160. Its totient is φ = 127578960108.
The previous prime is 134666680129. The next prime is 134666680147. The reversal of 134666680133 is 331086666431.
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, and also an emirpimes, since its reverse is a distinct semiprime: 331086666431 = 43 ⋅7699689917.
It is a cyclic number.
It is not a de Polignac number, because 134666680133 - 22 = 134666680129 is a prime.
It is a super-2 number, since 2×1346666801332 (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 (134666680163) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3543859985 + ... + 3543860022.
It is an arithmetic number, because the mean of its divisors is an integer number (35438600040).
Almost surely, 2134666680133 is an apocalyptic number.
It is an amenable number.
134666680133 is a deficient number, since it is larger than the sum of its proper divisors (7087720027).
134666680133 is an equidigital number, since it uses as much as digits as its factorization.
134666680133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7087720026.
The product of its (nonzero) digits is 1119744, while the sum is 47.
The spelling of 134666680133 in words is "one hundred thirty-four billion, six hundred sixty-six million, six hundred eighty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •