Base | Representation |
---|---|
bin | 111110001111111110… |
… | …1010001001011110111 |
3 | 110210001101202210002002 |
4 | 1330133331101023313 |
5 | 4142234104003142 |
6 | 141224541205515 |
7 | 12441501310355 |
oct | 1743775211367 |
9 | 423041683062 |
10 | 133680141047 |
11 | 51769a55612 |
12 | 21aa926089b |
13 | c7b546429b |
14 | 668215a7d5 |
15 | 3725ea5a32 |
hex | 1f1ff512f7 |
133680141047 has 4 divisors (see below), whose sum is σ = 135290745240. Its totient is φ = 132069536856.
The previous prime is 133680141029. The next prime is 133680141059. The reversal of 133680141047 is 740141086331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 740141086331 = 239 ⋅3096824629.
It is a cyclic number.
It is not a de Polignac number, because 133680141047 - 214 = 133680124663 is a prime.
It is a super-2 number, since 2×1336801410472 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 133680141047.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133680141017) 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, 805301972 + ... + 805302137.
It is an arithmetic number, because the mean of its divisors is an integer number (33822686310).
Almost surely, 2133680141047 is an apocalyptic number.
133680141047 is a deficient number, since it is larger than the sum of its proper divisors (1610604193).
133680141047 is an equidigital number, since it uses as much as digits as its factorization.
133680141047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1610604192.
The product of its (nonzero) digits is 48384, while the sum is 38.
The spelling of 133680141047 in words is "one hundred thirty-three billion, six hundred eighty million, one hundred forty-one thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •