Base | Representation |
---|---|
bin | 111110110001110… |
… | …0000001011110101 |
3 | 12102210200012100011 |
4 | 1331203200023311 |
5 | 13303223140434 |
6 | 545004420221 |
7 | 103125414334 |
oct | 17543401365 |
9 | 5383605304 |
10 | 2106458869 |
11 | 99104a7a9 |
12 | 4a9547671 |
13 | 27753c988 |
14 | 15da8bd1b |
15 | c4de0e64 |
hex | 7d8e02f5 |
2106458869 has 2 divisors, whose sum is σ = 2106458870. Its totient is φ = 2106458868.
The previous prime is 2106458867. The next prime is 2106458903. The reversal of 2106458869 is 9688546012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1467885969 + 638572900 = 38313^2 + 25270^2 .
It is a cyclic number.
It is not a de Polignac number, because 2106458869 - 21 = 2106458867 is a prime.
It is a super-2 number, since 2×21064588692 = 8874337933577518322, which contains 22 as substring.
Together with 2106458867, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2106458863) 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, 1053229434 + 1053229435.
It is an arithmetic number, because the mean of its divisors is an integer number (1053229435).
Almost surely, 22106458869 is an apocalyptic number.
It is an amenable number.
2106458869 is a deficient number, since it is larger than the sum of its proper divisors (1).
2106458869 is an equidigital number, since it uses as much as digits as its factorization.
2106458869 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 829440, while the sum is 49.
The square root of 2106458869 is about 45896.1748841883. The cubic root of 2106458869 is about 1281.8906932197.
The spelling of 2106458869 in words is "two billion, one hundred six million, four hundred fifty-eight thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •