Base | Representation |
---|---|
bin | 1011101101001110000… |
… | …0001101110111110001 |
3 | 201020010011222210101011 |
4 | 2323103200031313301 |
5 | 11243341413333432 |
6 | 232220345510521 |
7 | 20346602505145 |
oct | 2732340156761 |
9 | 636104883334 |
10 | 201116933617 |
11 | 783252a1a36 |
12 | 32b897a2441 |
13 | 15c7184b642 |
14 | 9a3c58b225 |
15 | 5371552847 |
hex | 2ed380ddf1 |
201116933617 has 4 divisors (see below), whose sum is σ = 201161442880. Its totient is φ = 201072424356.
The previous prime is 201116933609. The next prime is 201116933621. The reversal of 201116933617 is 716339611102.
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: 716339611102 = 2 ⋅358169805551.
It is a cyclic number.
It is not a de Polignac number, because 201116933617 - 23 = 201116933609 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201116933617.
It is not an unprimeable number, because it can be changed into a prime (201116933627) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22247853 + ... + 22256890.
It is an arithmetic number, because the mean of its divisors is an integer number (50290360720).
Almost surely, 2201116933617 is an apocalyptic number.
It is an amenable number.
201116933617 is a deficient number, since it is larger than the sum of its proper divisors (44509263).
201116933617 is an equidigital number, since it uses as much as digits as its factorization.
201116933617 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44509262.
The product of its (nonzero) digits is 40824, while the sum is 40.
The spelling of 201116933617 in words is "two hundred one billion, one hundred sixteen million, nine hundred thirty-three thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •