Base | Representation |
---|---|
bin | 111111010001101… |
… | …1101000110001001 |
3 | 12110222012220222221 |
4 | 1332203131012021 |
5 | 13322021122213 |
6 | 550404014041 |
7 | 103421046532 |
oct | 17643350611 |
9 | 5428186887 |
10 | 2123223433 |
11 | 99a560211 |
12 | 4b3091321 |
13 | 27ab5c536 |
14 | 161db3689 |
15 | c660338d |
hex | 7e8dd189 |
2123223433 has 2 divisors, whose sum is σ = 2123223434. Its totient is φ = 2123223432.
The previous prime is 2123223413. The next prime is 2123223437. The reversal of 2123223433 is 3343223212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1426421824 + 696801609 = 37768^2 + 26397^2 .
It is a cyclic number.
It is not a de Polignac number, because 2123223433 - 29 = 2123222921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2123223398 and 2123223407.
It is not a weakly prime, because it can be changed into another prime (2123223437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1061611716 + 1061611717.
It is an arithmetic number, because the mean of its divisors is an integer number (1061611717).
Almost surely, 22123223433 is an apocalyptic number.
It is an amenable number.
2123223433 is a deficient number, since it is larger than the sum of its proper divisors (1).
2123223433 is an equidigital number, since it uses as much as digits as its factorization.
2123223433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5184, while the sum is 25.
The square root of 2123223433 is about 46078.4486826542. The cubic root of 2123223433 is about 1285.2824166918.
Adding to 2123223433 its reverse (3343223212), we get a palindrome (5466446645).
The spelling of 2123223433 in words is "two billion, one hundred twenty-three million, two hundred twenty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •