Base | Representation |
---|---|
bin | 111101111111111001… |
… | …0000110111001111001 |
3 | 110201122210001021100012 |
4 | 1323333302012321321 |
5 | 4140132412010231 |
6 | 141055215351305 |
7 | 12422225153336 |
oct | 1737762067171 |
9 | 421583037305 |
10 | 133140344441 |
11 | 51512287415 |
12 | 21978522535 |
13 | c72a687100 |
14 | 66305a598d |
15 | 36e38cae2b |
hex | 1effc86e79 |
133140344441 has 6 divisors (see below), whose sum is σ = 144169722270. Its totient is φ = 122898779328.
The previous prime is 133140344401. The next prime is 133140344459. The reversal of 133140344441 is 144443041331.
It can be written as a sum of positive squares in 3 ways, for example, as 7402021225 + 125738323216 = 86035^2 + 354596^2 .
It is not a de Polignac number, because 133140344441 - 210 = 133140343417 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133140344398 and 133140344407.
It is not an unprimeable number, because it can be changed into a prime (133140344401) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 393906176 + ... + 393906513.
It is an arithmetic number, because the mean of its divisors is an integer number (24028287045).
Almost surely, 2133140344441 is an apocalyptic number.
It is an amenable number.
133140344441 is a deficient number, since it is larger than the sum of its proper divisors (11029377829).
133140344441 is an equidigital number, since it uses as much as digits as its factorization.
133140344441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 787812715 (or 787812702 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 133140344441 its reverse (144443041331), we get a palindrome (277583385772).
The spelling of 133140344441 in words is "one hundred thirty-three billion, one hundred forty million, three hundred forty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •