Base | Representation |
---|---|
bin | 110001011101000010… |
… | …1111011000101100101 |
3 | 101011010100112112210101 |
4 | 1202322011323011211 |
5 | 3220000020030041 |
6 | 120442131024101 |
7 | 10446524260603 |
oct | 1427205730545 |
9 | 334110475711 |
10 | 106201330021 |
11 | 41048978136 |
12 | 186ba73b031 |
13 | a026509ca7 |
14 | 51d68ba873 |
15 | 2b68890b31 |
hex | 18ba17b165 |
106201330021 has 2 divisors, whose sum is σ = 106201330022. Its totient is φ = 106201330020.
The previous prime is 106201329991. The next prime is 106201330031. The reversal of 106201330021 is 120033102601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 56530293121 + 49671036900 = 237761^2 + 222870^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106201330021 is a prime.
It is a super-2 number, since 2×1062013300212 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106201330031) 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, 53100665010 + 53100665011.
It is an arithmetic number, because the mean of its divisors is an integer number (53100665011).
Almost surely, 2106201330021 is an apocalyptic number.
It is an amenable number.
106201330021 is a deficient number, since it is larger than the sum of its proper divisors (1).
106201330021 is an equidigital number, since it uses as much as digits as its factorization.
106201330021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 106201330021 its reverse (120033102601), we get a palindrome (226234432622).
The spelling of 106201330021 in words is "one hundred six billion, two hundred one million, three hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •