Base | Representation |
---|---|
bin | 111110110101100… |
… | …1011101101000101 |
3 | 12102221110111000111 |
4 | 1331223023231011 |
5 | 13304232102013 |
6 | 545115513021 |
7 | 103151501035 |
oct | 17553135505 |
9 | 5387414014 |
10 | 2108472133 |
11 | 9921a5359 |
12 | 4aa158771 |
13 | 277a96161 |
14 | 1600538c5 |
15 | c518c73d |
hex | 7dacbb45 |
2108472133 has 2 divisors, whose sum is σ = 2108472134. Its totient is φ = 2108472132.
The previous prime is 2108472131. The next prime is 2108472139. The reversal of 2108472133 is 3312748012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2108462724 + 9409 = 45918^2 + 97^2 .
It is a cyclic number.
It is not a de Polignac number, because 2108472133 - 21 = 2108472131 is a prime.
Together with 2108472131, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2108472095 and 2108472104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2108472131) 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, 1054236066 + 1054236067.
It is an arithmetic number, because the mean of its divisors is an integer number (1054236067).
Almost surely, 22108472133 is an apocalyptic number.
It is an amenable number.
2108472133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2108472133 is an equidigital number, since it uses as much as digits as its factorization.
2108472133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 31.
The square root of 2108472133 is about 45918.1024542609. The cubic root of 2108472133 is about 1282.2989554233.
The spelling of 2108472133 in words is "two billion, one hundred eight million, four hundred seventy-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •