Base | Representation |
---|---|
bin | 1011101100011100011… |
… | …1011011100001011111 |
3 | 201012120200221020001211 |
4 | 2323013013123201133 |
5 | 11242430212444333 |
6 | 232144003245251 |
7 | 20341500152365 |
oct | 2730707334137 |
9 | 635520836054 |
10 | 200909109343 |
11 | 78228a55538 |
12 | 32b30079827 |
13 | 15c3a784bb7 |
14 | 9a1cb2d635 |
15 | 535d19eecd |
hex | 2ec71db85f |
200909109343 has 2 divisors, whose sum is σ = 200909109344. Its totient is φ = 200909109342.
The previous prime is 200909109287. The next prime is 200909109371. The reversal of 200909109343 is 343901909002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200909109343 - 217 = 200908978271 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200909109296 and 200909109305.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200909109043) 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, 100454554671 + 100454554672.
It is an arithmetic number, because the mean of its divisors is an integer number (100454554672).
Almost surely, 2200909109343 is an apocalyptic number.
200909109343 is a deficient number, since it is larger than the sum of its proper divisors (1).
200909109343 is an equidigital number, since it uses as much as digits as its factorization.
200909109343 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52488, while the sum is 40.
The spelling of 200909109343 in words is "two hundred billion, nine hundred nine million, one hundred nine thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •