Base | Representation |
---|---|
bin | 1011101010101000001… |
… | …0110110111000010011 |
3 | 201011022201011120101222 |
4 | 2322222002312320103 |
5 | 11240430332341121 |
6 | 232023341315255 |
7 | 20323425356042 |
oct | 2725202667023 |
9 | 634281146358 |
10 | 200421371411 |
11 | 77aa8703838 |
12 | 32a14865b2b |
13 | 15b90704181 |
14 | 99b404a559 |
15 | 533045a0ab |
hex | 2eaa0b6e13 |
200421371411 has 2 divisors, whose sum is σ = 200421371412. Its totient is φ = 200421371410.
The previous prime is 200421371383. The next prime is 200421371459. The reversal of 200421371411 is 114173124002.
200421371411 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200421371411 is a prime.
It is a super-2 number, since 2×2004213714112 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (200421371471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100210685705 + 100210685706.
It is an arithmetic number, because the mean of its divisors is an integer number (100210685706).
Almost surely, 2200421371411 is an apocalyptic number.
200421371411 is a deficient number, since it is larger than the sum of its proper divisors (1).
200421371411 is an equidigital number, since it uses as much as digits as its factorization.
200421371411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 26.
Adding to 200421371411 its reverse (114173124002), we get a palindrome (314594495413).
The spelling of 200421371411 in words is "two hundred billion, four hundred twenty-one million, three hundred seventy-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •