Base | Representation |
---|---|
bin | 1011101011010000110… |
… | …0011110011111001111 |
3 | 201011202120121101102202 |
4 | 2322310030132133033 |
5 | 11241302431240403 |
6 | 232052303312115 |
7 | 20330564010104 |
oct | 2726414363717 |
9 | 634676541382 |
10 | 200591665103 |
11 | 78085846a25 |
12 | 32a618ab63b |
13 | 15bb9a8a07b |
14 | 99cc8d8aab |
15 | 5340397688 |
hex | 2eb431e7cf |
200591665103 has 2 divisors, whose sum is σ = 200591665104. Its totient is φ = 200591665102.
The previous prime is 200591665081. The next prime is 200591665111. The reversal of 200591665103 is 301566195002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200591665103 - 210 = 200591664079 is a prime.
It is a super-2 number, since 2×2005916651032 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200591665123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100295832551 + 100295832552.
It is an arithmetic number, because the mean of its divisors is an integer number (100295832552).
Almost surely, 2200591665103 is an apocalyptic number.
200591665103 is a deficient number, since it is larger than the sum of its proper divisors (1).
200591665103 is an equidigital number, since it uses as much as digits as its factorization.
200591665103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48600, while the sum is 38.
The spelling of 200591665103 in words is "two hundred billion, five hundred ninety-one million, six hundred sixty-five thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •