Base | Representation |
---|---|
bin | 111110101011011… |
… | …0011111101110111 |
3 | 12102120102011202122 |
4 | 1331112303331313 |
5 | 13301400211043 |
6 | 544405230155 |
7 | 103055220146 |
oct | 17526637567 |
9 | 5376364678 |
10 | 2103132023 |
11 | 98a188243 |
12 | 4a840235b |
13 | 276946625 |
14 | 15d46375d |
15 | c4985368 |
hex | 7d5b3f77 |
2103132023 has 8 divisors (see below), whose sum is σ = 2159563056. Its totient is φ = 2046945600.
The previous prime is 2103132013. The next prime is 2103132037. The reversal of 2103132023 is 3202313012.
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 2103132023 - 210 = 2103130999 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2103131992 and 2103132010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2103132013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43661 + ... + 78182.
It is an arithmetic number, because the mean of its divisors is an integer number (269945382).
Almost surely, 22103132023 is an apocalyptic number.
2103132023 is a deficient number, since it is larger than the sum of its proper divisors (56431033).
2103132023 is a wasteful number, since it uses less digits than its factorization.
2103132023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122305.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 2103132023 is about 45859.9173898078. The cubic root of 2103132023 is about 1281.2154842084.
Adding to 2103132023 its reverse (3202313012), we get a palindrome (5305445035).
The spelling of 2103132023 in words is "two billion, one hundred three million, one hundred thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •