Base | Representation |
---|---|
bin | 1001000110010111111001… |
… | …11000000010001011010101 |
3 | 2121211221211020221222021002 |
4 | 10203023330320002023111 |
5 | 10110321342223242211 |
6 | 110320320432033045 |
7 | 4133455262263544 |
oct | 443137470021325 |
9 | 77757736858232 |
10 | 20010200212181 |
11 | 641530739a463 |
12 | 22b213b692785 |
13 | b21c52600c4a |
14 | 4d26dac1a15b |
15 | 24a7a05e103b |
hex | 1232fce022d5 |
20010200212181 has 2 divisors, whose sum is σ = 20010200212182. Its totient is φ = 20010200212180.
The previous prime is 20010200212103. The next prime is 20010200212213. The reversal of 20010200212181 is 18121200201002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18092900280625 + 1917299931556 = 4253575^2 + 1384666^2 .
It is a cyclic number.
It is not a de Polignac number, because 20010200212181 - 230 = 20009126470357 is a prime.
It is a super-2 number, since 2×200102002121812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20010200212381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10005100106090 + 10005100106091.
It is an arithmetic number, because the mean of its divisors is an integer number (10005100106091).
Almost surely, 220010200212181 is an apocalyptic number.
It is an amenable number.
20010200212181 is a deficient number, since it is larger than the sum of its proper divisors (1).
20010200212181 is an equidigital number, since it uses as much as digits as its factorization.
20010200212181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 20010200212181 its reverse (18121200201002), we get a palindrome (38131400413183).
The spelling of 20010200212181 in words is "twenty trillion, ten billion, two hundred million, two hundred twelve thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •