Base | Representation |
---|---|
bin | 111110100111100… |
… | …0100010110111101 |
3 | 12102102121001010002 |
4 | 1331033010112331 |
5 | 13300340231023 |
6 | 544253524045 |
7 | 103032033563 |
oct | 17517042675 |
9 | 5372531102 |
10 | 2101102013 |
11 | 98902104a |
12 | 4a77a3625 |
13 | 2763b563a |
14 | 15d095a33 |
15 | c46d3b28 |
hex | 7d3c45bd |
2101102013 has 2 divisors, whose sum is σ = 2101102014. Its totient is φ = 2101102012.
The previous prime is 2101101979. The next prime is 2101102021. The reversal of 2101102013 is 3102011012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1147651129 + 953450884 = 33877^2 + 30878^2 .
It is a cyclic number.
It is not a de Polignac number, because 2101102013 - 218 = 2100839869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2101101985 and 2101102003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2101102093) 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, 1050551006 + 1050551007.
It is an arithmetic number, because the mean of its divisors is an integer number (1050551007).
Almost surely, 22101102013 is an apocalyptic number.
It is an amenable number.
2101102013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2101102013 is an equidigital number, since it uses as much as digits as its factorization.
2101102013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 2101102013 is about 45837.7793201198. The cubic root of 2101102013 is about 1280.8031281789.
Adding to 2101102013 its reverse (3102011012), we get a palindrome (5203113025).
The spelling of 2101102013 in words is "two billion, one hundred one million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •