Base | Representation |
---|---|
bin | 111110110010000… |
… | …0111100101110001 |
3 | 12102210222101202002 |
4 | 1331210013211301 |
5 | 13303243322043 |
6 | 545012103345 |
7 | 103126656032 |
oct | 17544074561 |
9 | 5383871662 |
10 | 2106620273 |
11 | 99114aa9a |
12 | 4a9604b55 |
13 | 277598294 |
14 | 15dad0a89 |
15 | c4e23bb8 |
hex | 7d907971 |
2106620273 has 2 divisors, whose sum is σ = 2106620274. Its totient is φ = 2106620272.
The previous prime is 2106620251. The next prime is 2106620281. The reversal of 2106620273 is 3720266012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1739974369 + 366645904 = 41713^2 + 19148^2 .
It is a cyclic number.
It is not a de Polignac number, because 2106620273 - 230 = 1032878449 is a prime.
It is a super-2 number, since 2×21066202732 = 8875697949229189058, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2106620473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1053310136 + 1053310137.
It is an arithmetic number, because the mean of its divisors is an integer number (1053310137).
Almost surely, 22106620273 is an apocalyptic number.
It is an amenable number.
2106620273 is a deficient number, since it is larger than the sum of its proper divisors (1).
2106620273 is an equidigital number, since it uses as much as digits as its factorization.
2106620273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 29.
The square root of 2106620273 is about 45897.9332105488. The cubic root of 2106620273 is about 1281.9234333163.
Adding to 2106620273 its reverse (3720266012), we get a palindrome (5826886285).
The spelling of 2106620273 in words is "two billion, one hundred six million, six hundred twenty thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •