Base | Representation |
---|---|
bin | 11110101101010011010… |
… | …011011110110011110101 |
3 | 21110201212022120011202111 |
4 | 132231103103132303311 |
5 | 234033220444330242 |
6 | 4253231422411021 |
7 | 305313244535032 |
oct | 36552323366365 |
9 | 7421768504674 |
10 | 2110226558197 |
11 | 743a3a97347a |
12 | 2a0b86730a71 |
13 | 123cbb986a84 |
14 | 741c7baa389 |
15 | 39d59e28817 |
hex | 1eb534decf5 |
2110226558197 has 2 divisors, whose sum is σ = 2110226558198. Its totient is φ = 2110226558196.
The previous prime is 2110226558171. The next prime is 2110226558201. The reversal of 2110226558197 is 7918556220112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1220249413201 + 889977144996 = 1104649^2 + 943386^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2110226558197 is a prime.
It is a super-2 number, since 2×21102265581972 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2110226558197.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2110226558107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055113279098 + 1055113279099.
It is an arithmetic number, because the mean of its divisors is an integer number (1055113279099).
Almost surely, 22110226558197 is an apocalyptic number.
It is an amenable number.
2110226558197 is a deficient number, since it is larger than the sum of its proper divisors (1).
2110226558197 is an equidigital number, since it uses as much as digits as its factorization.
2110226558197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 604800, while the sum is 49.
The spelling of 2110226558197 in words is "two trillion, one hundred ten billion, two hundred twenty-six million, five hundred fifty-eight thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •