Base | Representation |
---|---|
bin | 111110001100011001… |
… | …1001110000100100101 |
3 | 110202202000211100112202 |
4 | 1330120303032010211 |
5 | 4142012334110331 |
6 | 141205011424245 |
7 | 12435512555342 |
oct | 1743063160445 |
9 | 422660740482 |
10 | 133560066341 |
11 | 517081a2719 |
12 | 21a74bb5085 |
13 | c796612370 |
14 | 66702217c9 |
15 | 371a687ecb |
hex | 1f18cce125 |
133560066341 has 16 divisors (see below), whose sum is σ = 148809519600. Its totient is φ = 119022317568.
The previous prime is 133560066331. The next prime is 133560066379. The reversal of 133560066341 is 143660065331.
It can be written as a sum of positive squares in 8 ways, for example, as 16725990241 + 116834076100 = 129329^2 + 341810^2 .
It is a cyclic number.
It is not a de Polignac number, because 133560066341 - 214 = 133560049957 is a prime.
It is a super-2 number, since 2×1335600663412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133560066295 and 133560066304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133560066331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7016645 + ... + 7035653.
It is an arithmetic number, because the mean of its divisors is an integer number (9300594975).
Almost surely, 2133560066341 is an apocalyptic number.
It is an amenable number.
133560066341 is a deficient number, since it is larger than the sum of its proper divisors (15249453259).
133560066341 is a wasteful number, since it uses less digits than its factorization.
133560066341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37688.
The product of its (nonzero) digits is 116640, while the sum is 38.
The spelling of 133560066341 in words is "one hundred thirty-three billion, five hundred sixty million, sixty-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •