Base | Representation |
---|---|
bin | 111101111110100011… |
… | …1111010110111010001 |
3 | 110201112200002122201020 |
4 | 1323331013322313101 |
5 | 4140040001340031 |
6 | 141050543230053 |
7 | 12421144021056 |
oct | 1737507726721 |
9 | 421480078636 |
10 | 133095730641 |
11 | 5149a085405 |
12 | 219655a8329 |
13 | c721366503 |
14 | 66286b102d |
15 | 36dea17096 |
hex | 1efd1fadd1 |
133095730641 has 32 divisors (see below), whose sum is σ = 180487802880. Its totient is φ = 87231767616.
The previous prime is 133095730609. The next prime is 133095730661. The reversal of 133095730641 is 146037590331.
It is a happy number.
It is not a de Polignac number, because 133095730641 - 25 = 133095730609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133095730593 and 133095730602.
It is not an unprimeable number, because it can be changed into a prime (133095730661) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35330140 + ... + 35333906.
It is an arithmetic number, because the mean of its divisors is an integer number (5640243840).
Almost surely, 2133095730641 is an apocalyptic number.
It is an amenable number.
133095730641 is a deficient number, since it is larger than the sum of its proper divisors (47392072239).
133095730641 is a wasteful number, since it uses less digits than its factorization.
133095730641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4693.
The product of its (nonzero) digits is 204120, while the sum is 42.
The spelling of 133095730641 in words is "one hundred thirty-three billion, ninety-five million, seven hundred thirty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •