Base | Representation |
---|---|
bin | 111110010000110000… |
… | …0101111011001011001 |
3 | 110210010012211120121221 |
4 | 1330201200233121121 |
5 | 4142312242421144 |
6 | 141231312132041 |
7 | 12442236043606 |
oct | 1744140573131 |
9 | 423105746557 |
10 | 133706217049 |
11 | 51782745929 |
12 | 21ab5b37021 |
13 | c7ba994182 |
14 | 66857c76ad |
15 | 3728406d84 |
hex | 1f2182f659 |
133706217049 has 2 divisors, whose sum is σ = 133706217050. Its totient is φ = 133706217048.
The previous prime is 133706217041. The next prime is 133706217079. The reversal of 133706217049 is 940712607331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 133566859024 + 139358025 = 365468^2 + 11805^2 .
It is a cyclic number.
It is not a de Polignac number, because 133706217049 - 23 = 133706217041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133706216996 and 133706217014.
It is not a weakly prime, because it can be changed into another prime (133706217041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66853108524 + 66853108525.
It is an arithmetic number, because the mean of its divisors is an integer number (66853108525).
Almost surely, 2133706217049 is an apocalyptic number.
It is an amenable number.
133706217049 is a deficient number, since it is larger than the sum of its proper divisors (1).
133706217049 is an equidigital number, since it uses as much as digits as its factorization.
133706217049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 190512, while the sum is 43.
The spelling of 133706217049 in words is "one hundred thirty-three billion, seven hundred six million, two hundred seventeen thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •