Base | Representation |
---|---|
bin | 110000001101000010011011… |
… | …110100101011110011010001 |
3 | 1000210122012201211102020122101 |
4 | 300031002123310223303101 |
5 | 210241421001200304222 |
6 | 2030520244405240401 |
7 | 62440440102160261 |
oct | 6015023364536321 |
9 | 1023565654366571 |
10 | 212002200009937 |
11 | 616066a0024187 |
12 | 1b93b543a03101 |
13 | 913a94c6b479c |
14 | 3a4cd658837a1 |
15 | 19799e51ce927 |
hex | c0d09bd2bcd1 |
212002200009937 has 2 divisors, whose sum is σ = 212002200009938. Its totient is φ = 212002200009936.
The previous prime is 212002200009869. The next prime is 212002200010043. The reversal of 212002200009937 is 739900002200212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 178601013060561 + 33401186949376 = 13364169^2 + 5779376^2 .
It is a cyclic number.
It is not a de Polignac number, because 212002200009937 - 223 = 212002191621329 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212002200009896 and 212002200009905.
It is not a weakly prime, because it can be changed into another prime (212002200009337) 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, 106001100004968 + 106001100004969.
It is an arithmetic number, because the mean of its divisors is an integer number (106001100004969).
Almost surely, 2212002200009937 is an apocalyptic number.
It is an amenable number.
212002200009937 is a deficient number, since it is larger than the sum of its proper divisors (1).
212002200009937 is an equidigital number, since it uses as much as digits as its factorization.
212002200009937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 37.
The spelling of 212002200009937 in words is "two hundred twelve trillion, two billion, two hundred million, nine thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •