Base | Representation |
---|---|
bin | 1011101001100000010… |
… | …1100110101000100011 |
3 | 201010112201021110122211 |
4 | 2322120011212220203 |
5 | 11234321221221121 |
6 | 231533420142551 |
7 | 20313106536616 |
oct | 2723005465043 |
9 | 633481243584 |
10 | 200120101411 |
11 | 7796364216a |
12 | 3294b997a57 |
13 | 15b431802b9 |
14 | 998602617d |
15 | 5313c99ce1 |
hex | 2e98166a23 |
200120101411 has 2 divisors, whose sum is σ = 200120101412. Its totient is φ = 200120101410.
The previous prime is 200120101409. The next prime is 200120101427. The reversal of 200120101411 is 114101021002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200120101411 - 21 = 200120101409 is a prime.
Together with 200120101409, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 200120101391 and 200120101400.
It is not a weakly prime, because it can be changed into another prime (200120101481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100060050705 + 100060050706.
It is an arithmetic number, because the mean of its divisors is an integer number (100060050706).
Almost surely, 2200120101411 is an apocalyptic number.
200120101411 is a deficient number, since it is larger than the sum of its proper divisors (1).
200120101411 is an equidigital number, since it uses as much as digits as its factorization.
200120101411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200120101411 its reverse (114101021002), we get a palindrome (314221122413).
The spelling of 200120101411 in words is "two hundred billion, one hundred twenty million, one hundred one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •