Base | Representation |
---|---|
bin | 1011101010010100110… |
… | …0011100101001110111 |
3 | 201011010001001102220222 |
4 | 2322211030130221313 |
5 | 11240244014434401 |
6 | 232011313244555 |
7 | 20321416616522 |
oct | 2724514345167 |
9 | 634101042828 |
10 | 200339999351 |
11 | 77a667857a8 |
12 | 329b156375b |
13 | 15b798b341b |
14 | 99a7307bb9 |
15 | 5328234c1b |
hex | 2ea531ca77 |
200339999351 has 2 divisors, whose sum is σ = 200339999352. Its totient is φ = 200339999350.
The previous prime is 200339999303. The next prime is 200339999357. The reversal of 200339999351 is 153999933002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200339999351 - 26 = 200339999287 is a prime.
It is a super-2 number, since 2×2003399993512 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200339999293 and 200339999302.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200339999357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100169999675 + 100169999676.
It is an arithmetic number, because the mean of its divisors is an integer number (100169999676).
Almost surely, 2200339999351 is an apocalyptic number.
200339999351 is a deficient number, since it is larger than the sum of its proper divisors (1).
200339999351 is an equidigital number, since it uses as much as digits as its factorization.
200339999351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1771470, while the sum is 53.
The spelling of 200339999351 in words is "two hundred billion, three hundred thirty-nine million, nine hundred ninety-nine thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •