Base | Representation |
---|---|
bin | 111110101011100… |
… | …0101010011001111 |
3 | 12102120112210011021 |
4 | 1331113011103033 |
5 | 13301404444043 |
6 | 544410535011 |
7 | 103055634145 |
oct | 17527052317 |
9 | 5376483137 |
10 | 2103203023 |
11 | 98a226619 |
12 | 4a8437467 |
13 | 27696ca3c |
14 | 15d481595 |
15 | c499b3ed |
hex | 7d5c54cf |
2103203023 has 8 divisors (see below), whose sum is σ = 2120518400. Its totient is φ = 2085919128.
The previous prime is 2103203009. The next prime is 2103203027. The reversal of 2103203023 is 3203023012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2103203023 - 217 = 2103071951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2103202988 and 2103203006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2103203027) 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 7 ways as a sum of consecutive naturals, for example, 137140 + ... + 151702.
It is an arithmetic number, because the mean of its divisors is an integer number (265064800).
Almost surely, 22103203023 is an apocalyptic number.
2103203023 is a deficient number, since it is larger than the sum of its proper divisors (17315377).
2103203023 is a wasteful number, since it uses less digits than its factorization.
2103203023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15741.
The product of its (nonzero) digits is 216, while the sum is 16.
The square root of 2103203023 is about 45860.6914797411. The cubic root of 2103203023 is about 1281.2299016383.
Adding to 2103203023 its reverse (3203023012), we get a palindrome (5306226035).
The spelling of 2103203023 in words is "two billion, one hundred three million, two hundred three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •