Base | Representation |
---|---|
bin | 111110010000000000… |
… | …1010010110000011011 |
3 | 110210001110202101021121 |
4 | 1330200001102300123 |
5 | 4142234341233214 |
6 | 141225015550111 |
7 | 12441513263245 |
oct | 1744001226033 |
9 | 423043671247 |
10 | 133681196059 |
11 | 5176a606224 |
12 | 21aa968b337 |
13 | c7b5743558 |
14 | 6682353095 |
15 | 3726113424 |
hex | 1f20052c1b |
133681196059 has 8 divisors (see below), whose sum is σ = 134241464448. Its totient is φ = 133121896320.
The previous prime is 133681196041. The next prime is 133681196123. The reversal of 133681196059 is 950691186331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133681196059 - 27 = 133681195931 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133681195997 and 133681196015.
It is not an unprimeable number, because it can be changed into a prime (133681193059) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35094 + ... + 518260.
It is an arithmetic number, because the mean of its divisors is an integer number (16780183056).
Almost surely, 2133681196059 is an apocalyptic number.
133681196059 is a deficient number, since it is larger than the sum of its proper divisors (560268389).
133681196059 is an equidigital number, since it uses as much as digits as its factorization.
133681196059 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 484325.
The product of its (nonzero) digits is 1049760, while the sum is 52.
The spelling of 133681196059 in words is "one hundred thirty-three billion, six hundred eighty-one million, one hundred ninety-six thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •