Base | Representation |
---|---|
bin | 111110101011111… |
… | …1000000101001111 |
3 | 12102120221100110222 |
4 | 1331113320011033 |
5 | 13301433123043 |
6 | 544415221555 |
7 | 103060461440 |
oct | 17527700517 |
9 | 5376840428 |
10 | 2103411023 |
11 | 98a35891a |
12 | 4a85178bb |
13 | 276a1360c |
14 | 15d4d72c7 |
15 | c49dcd68 |
hex | 7d5f814f |
2103411023 has 4 divisors (see below), whose sum is σ = 2403898320. Its totient is φ = 1802923728.
The previous prime is 2103411007. The next prime is 2103411043. The reversal of 2103411023 is 3201143012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2103411023 - 24 = 2103411007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2103410992 and 2103411010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2103411043) 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 in 3 ways as a sum of consecutive naturals, for example, 150243638 + ... + 150243651.
It is an arithmetic number, because the mean of its divisors is an integer number (600974580).
Almost surely, 22103411023 is an apocalyptic number.
2103411023 is a deficient number, since it is larger than the sum of its proper divisors (300487297).
2103411023 is an equidigital number, since it uses as much as digits as its factorization.
2103411023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300487296.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2103411023 is about 45862.9591609613. The cubic root of 2103411023 is about 1281.2721367486.
Adding to 2103411023 its reverse (3201143012), we get a palindrome (5304554035).
The spelling of 2103411023 in words is "two billion, one hundred three million, four hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •