Base | Representation |
---|---|
bin | 1011101001011101111… |
… | …1000111011000001111 |
3 | 201010112000021212110221 |
4 | 2322113133013120033 |
5 | 11234311130340134 |
6 | 231532420012211 |
7 | 20312625015316 |
oct | 2722737073017 |
9 | 633460255427 |
10 | 200110011919 |
11 | 77958980844 |
12 | 32948531067 |
13 | 15b41059a9c |
14 | 998495b27d |
15 | 5312e555b4 |
hex | 2e977c760f |
200110011919 has 2 divisors, whose sum is σ = 200110011920. Its totient is φ = 200110011918.
The previous prime is 200110011911. The next prime is 200110011953. The reversal of 200110011919 is 919110011002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200110011919 - 23 = 200110011911 is a prime.
It is a super-2 number, since 2×2001100119192 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200110011893 and 200110011902.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200110011911) 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, 100055005959 + 100055005960.
It is an arithmetic number, because the mean of its divisors is an integer number (100055005960).
Almost surely, 2200110011919 is an apocalyptic number.
200110011919 is a deficient number, since it is larger than the sum of its proper divisors (1).
200110011919 is an equidigital number, since it uses as much as digits as its factorization.
200110011919 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 25.
The spelling of 200110011919 in words is "two hundred billion, one hundred ten million, eleven thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •