Base | Representation |
---|---|
bin | 1011101010101000001… |
… | …0101000011001100101 |
3 | 201011022201001120001022 |
4 | 2322222002220121211 |
5 | 11240430323441401 |
6 | 232023340140525 |
7 | 20323425021113 |
oct | 2725202503145 |
9 | 634281046038 |
10 | 200421312101 |
11 | 77aa867321a |
12 | 32a14837745 |
13 | 15b906b318a |
14 | 99b4032ab3 |
15 | 533044771b |
hex | 2eaa0a8665 |
200421312101 has 2 divisors, whose sum is σ = 200421312102. Its totient is φ = 200421312100.
The previous prime is 200421312097. The next prime is 200421312107. The reversal of 200421312101 is 101213124002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 130328220100 + 70093092001 = 361010^2 + 264751^2 .
It is a cyclic number.
It is not a de Polignac number, because 200421312101 - 22 = 200421312097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200421312101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200421312107) 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, 100210656050 + 100210656051.
It is an arithmetic number, because the mean of its divisors is an integer number (100210656051).
Almost surely, 2200421312101 is an apocalyptic number.
It is an amenable number.
200421312101 is a deficient number, since it is larger than the sum of its proper divisors (1).
200421312101 is an equidigital number, since it uses as much as digits as its factorization.
200421312101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 200421312101 its reverse (101213124002), we get a palindrome (301634436103).
The spelling of 200421312101 in words is "two hundred billion, four hundred twenty-one million, three hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •