Base | Representation |
---|---|
bin | 111110101101010… |
… | …0111101100010011 |
3 | 12102122021220011201 |
4 | 1331122213230103 |
5 | 13302124132243 |
6 | 544442452031 |
7 | 103066545511 |
oct | 17532475423 |
9 | 5378256151 |
10 | 2104130323 |
11 | 98a7aa289 |
12 | 4a8804017 |
13 | 276c05b39 |
14 | 15d6434b1 |
15 | c4ad104d |
hex | 7d6a7b13 |
2104130323 has 4 divisors (see below), whose sum is σ = 2106440928. Its totient is φ = 2101819720.
The previous prime is 2104130297. The next prime is 2104130333. The reversal of 2104130323 is 3230314012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2104130323 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2104130323.
It is not an unprimeable number, because it can be changed into a prime (2104130333) 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, 1153936 + ... + 1155757.
It is an arithmetic number, because the mean of its divisors is an integer number (526610232).
Almost surely, 22104130323 is an apocalyptic number.
2104130323 is a deficient number, since it is larger than the sum of its proper divisors (2310605).
2104130323 is an equidigital number, since it uses as much as digits as its factorization.
2104130323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2310604.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 2104130323 is about 45870.8003309295. The cubic root of 2104130323 is about 1281.4181716102.
Adding to 2104130323 its reverse (3230314012), we get a palindrome (5334444335).
The spelling of 2104130323 in words is "two billion, one hundred four million, one hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •