Base | Representation |
---|---|
bin | 111110001000111010… |
… | …1000001110110001000 |
3 | 110202102212201211221112 |
4 | 1330101311001312020 |
5 | 4141242413200130 |
6 | 141145232425452 |
7 | 12432562430615 |
oct | 1742165016610 |
9 | 422385654845 |
10 | 133443100040 |
11 | 51658173158 |
12 | 21a419a8288 |
13 | c77830b233 |
14 | 665c89550c |
15 | 3710281495 |
hex | 1f11d41d88 |
133443100040 has 32 divisors (see below), whose sum is σ = 317908563480. Its totient is φ = 50237402112.
The previous prime is 133443100031. The next prime is 133443100151. The reversal of 133443100040 is 40001344331.
It can be written as a sum of positive squares in 4 ways, for example, as 100947269284 + 32495830756 = 317722^2 + 180266^2 .
It is a junction number, because it is equal to n+sod(n) for n = 133443099979 and 133443100015.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 98119247 + ... + 98120606.
Almost surely, 2133443100040 is an apocalyptic number.
133443100040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133443100040 is an abundant number, since it is smaller than the sum of its proper divisors (184465463440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133443100040 is a wasteful number, since it uses less digits than its factorization.
133443100040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196239881 (or 196239877 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 133443100040 its reverse (40001344331), we get a palindrome (173444444371).
The spelling of 133443100040 in words is "one hundred thirty-three billion, four hundred forty-three million, one hundred thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •