Base | Representation |
---|---|
bin | 100000001010011101110… |
… | …100111000001000111101 |
3 | 21211022001220011010110112 |
4 | 200022131310320020331 |
5 | 242203103313340433 |
6 | 4411214021315405 |
7 | 315454221102113 |
oct | 40123564701075 |
9 | 7738056133415 |
10 | 2210261074493 |
11 | 78240383413a |
12 | 2b8443b65b65 |
13 | 130571690054 |
14 | 78d97653ab3 |
15 | 3c7621d0348 |
hex | 2029dd3823d |
2210261074493 has 2 divisors, whose sum is σ = 2210261074494. Its totient is φ = 2210261074492.
The previous prime is 2210261074481. The next prime is 2210261074561. The reversal of 2210261074493 is 3944701620122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1568911563844 + 641349510649 = 1252562^2 + 800843^2 .
It is a cyclic number.
It is not a de Polignac number, because 2210261074493 - 212 = 2210261070397 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2210261074493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2210261074433) 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, 1105130537246 + 1105130537247.
It is an arithmetic number, because the mean of its divisors is an integer number (1105130537247).
Almost surely, 22210261074493 is an apocalyptic number.
It is an amenable number.
2210261074493 is a deficient number, since it is larger than the sum of its proper divisors (1).
2210261074493 is an equidigital number, since it uses as much as digits as its factorization.
2210261074493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145152, while the sum is 41.
The spelling of 2210261074493 in words is "two trillion, two hundred ten billion, two hundred sixty-one million, seventy-four thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •