Base | Representation |
---|---|
bin | 111110100111111… |
… | …1100100000111111 |
3 | 12102110000201122021 |
4 | 1331033330200333 |
5 | 13300420111111 |
6 | 544302501011 |
7 | 103034012311 |
oct | 17517744077 |
9 | 5373021567 |
10 | 2101332031 |
11 | 989168947 |
12 | 4a7894767 |
13 | 276466246 |
14 | 15d1157b1 |
15 | c472bd71 |
hex | 7d3fc83f |
2101332031 has 2 divisors, whose sum is σ = 2101332032. Its totient is φ = 2101332030.
The previous prime is 2101332017. The next prime is 2101332047. The reversal of 2101332031 is 1302331012.
It is an a-pointer prime, because the next prime (2101332047) can be obtained adding 2101332031 to its sum of digits (16).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2101332031 - 219 = 2100807743 is a prime.
It is a super-2 number, since 2×21013320312 = 8831192609013169922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2101331996 and 2101332014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2101332001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050666015 + 1050666016.
It is an arithmetic number, because the mean of its divisors is an integer number (1050666016).
Almost surely, 22101332031 is an apocalyptic number.
2101332031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2101332031 is an equidigital number, since it uses as much as digits as its factorization.
2101332031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 2101332031 is about 45840.2882953412. The cubic root of 2101332031 is about 1280.8498650852.
Adding to 2101332031 its reverse (1302331012), we get a palindrome (3403663043).
The spelling of 2101332031 in words is "two billion, one hundred one million, three hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •