Base | Representation |
---|---|
bin | 111110100111100… |
… | …0100000111100101 |
3 | 12102102120222202122 |
4 | 1331033010013211 |
5 | 13300340213104 |
6 | 544253515325 |
7 | 103032030656 |
oct | 17517040745 |
9 | 5372528678 |
10 | 2101101029 |
11 | 989020335 |
12 | 4a77a2b45 |
13 | 2763b5061 |
14 | 15d09552d |
15 | c46d36be |
hex | 7d3c41e5 |
2101101029 has 2 divisors, whose sum is σ = 2101101030. Its totient is φ = 2101101028.
The previous prime is 2101100999. The next prime is 2101101031. The reversal of 2101101029 is 9201011012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2095350625 + 5750404 = 45775^2 + 2398^2 .
It is a cyclic number.
It is not a de Polignac number, because 2101101029 - 28 = 2101100773 is a prime.
Together with 2101101031, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2101100998 and 2101101016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2101101049) 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, 1050550514 + 1050550515.
It is an arithmetic number, because the mean of its divisors is an integer number (1050550515).
Almost surely, 22101101029 is an apocalyptic number.
It is an amenable number.
2101101029 is a deficient number, since it is larger than the sum of its proper divisors (1).
2101101029 is an equidigital number, since it uses as much as digits as its factorization.
2101101029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
The square root of 2101101029 is about 45837.7685866142. The cubic root of 2101101029 is about 1280.8029282345.
The spelling of 2101101029 in words is "two billion, one hundred one million, one hundred one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •