Base | Representation |
---|---|
bin | 111111010001111… |
… | …0111001100010011 |
3 | 12110222102100121211 |
4 | 1332203313030103 |
5 | 13322033032243 |
6 | 550410200551 |
7 | 103422003262 |
oct | 17643671423 |
9 | 5428370554 |
10 | 2123330323 |
11 | 99a623554 |
12 | 4b3123157 |
13 | 27ab9909a |
14 | 1620005d9 |
15 | c6624d9d |
hex | 7e8f7313 |
2123330323 has 4 divisors (see below), whose sum is σ = 2196548640. Its totient is φ = 2050112008.
The previous prime is 2123330303. The next prime is 2123330333. The reversal of 2123330323 is 3230333212.
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 2123330323 - 29 = 2123329811 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2123330294 and 2123330303.
It is not an unprimeable number, because it can be changed into a prime (2123330303) 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, 36609115 + ... + 36609172.
It is an arithmetic number, because the mean of its divisors is an integer number (549137160).
Almost surely, 22123330323 is an apocalyptic number.
2123330323 is a deficient number, since it is larger than the sum of its proper divisors (73218317).
2123330323 is an equidigital number, since it uses as much as digits as its factorization.
2123330323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73218316.
The product of its (nonzero) digits is 1944, while the sum is 22.
The square root of 2123330323 is about 46079.6085378337. The cubic root of 2123330323 is about 1285.3039847677.
Adding to 2123330323 its reverse (3230333212), we get a palindrome (5353663535).
The spelling of 2123330323 in words is "two billion, one hundred twenty-three million, three hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •