Base | Representation |
---|---|
bin | 111110010000110001… |
… | …0010001001010101101 |
3 | 110210010020120220222002 |
4 | 1330201202101022231 |
5 | 4142312343230032 |
6 | 141231324502045 |
7 | 12442242332264 |
oct | 1744142211255 |
9 | 423106526862 |
10 | 133706617517 |
11 | 517829997a0 |
12 | 21ab60aa925 |
13 | c7baaa4535 |
14 | 668588d5db |
15 | 3728485862 |
hex | 1f218912ad |
133706617517 has 4 divisors (see below), whose sum is σ = 145861764576. Its totient is φ = 121551470460.
The previous prime is 133706617487. The next prime is 133706617613. The reversal of 133706617517 is 715716607331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 715716607331 = 11 ⋅65065146121.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133706617517 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133706617717) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 6077573513 + ... + 6077573534.
It is an arithmetic number, because the mean of its divisors is an integer number (36465441144).
Almost surely, 2133706617517 is an apocalyptic number.
It is an amenable number.
133706617517 is a deficient number, since it is larger than the sum of its proper divisors (12155147059).
133706617517 is a wasteful number, since it uses less digits than its factorization.
133706617517 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12155147058.
The product of its (nonzero) digits is 555660, while the sum is 47.
The spelling of 133706617517 in words is "one hundred thirty-three billion, seven hundred six million, six hundred seventeen thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •