Base | Representation |
---|---|
bin | 111110100110000… |
… | …0101011100010111 |
3 | 12102101010022102111 |
4 | 1331030011130113 |
5 | 13300140220043 |
6 | 544225051451 |
7 | 103022265664 |
oct | 17514053427 |
9 | 5371108374 |
10 | 2100320023 |
11 | 98863757a |
12 | 4a7486b87 |
13 | 2761a0719 |
14 | 15cd30a6b |
15 | c45cc09d |
hex | 7d305717 |
2100320023 has 2 divisors, whose sum is σ = 2100320024. Its totient is φ = 2100320022.
The previous prime is 2100320009. The next prime is 2100320051. The reversal of 2100320023 is 3200230012.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2100320023 - 29 = 2100319511 is a prime.
It is a super-2 number, since 2×21003200232 = 8822688398029441058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2100319985 and 2100320012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2100300023) 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, 1050160011 + 1050160012.
It is an arithmetic number, because the mean of its divisors is an integer number (1050160012).
Almost surely, 22100320023 is an apocalyptic number.
2100320023 is a deficient number, since it is larger than the sum of its proper divisors (1).
2100320023 is an equidigital number, since it uses as much as digits as its factorization.
2100320023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 13.
The square root of 2100320023 is about 45829.2485537348. The cubic root of 2100320023 is about 1280.6442116495.
Adding to 2100320023 its reverse (3200230012), we get a palindrome (5300550035).
The spelling of 2100320023 in words is "two billion, one hundred million, three hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •