Base | Representation |
---|---|
bin | 10101101100111011… |
… | …110001000110101001 |
3 | 2020010222122202222111 |
4 | 111230323301012221 |
5 | 340210411142213 |
6 | 14412140122321 |
7 | 1453312333603 |
oct | 255473610651 |
9 | 66128582874 |
10 | 23302443433 |
11 | 9978692715 |
12 | 4623b363a1 |
13 | 2274934189 |
14 | 11b0b3a173 |
15 | 915b52a3d |
hex | 56cef11a9 |
23302443433 has 2 divisors, whose sum is σ = 23302443434. Its totient is φ = 23302443432.
The previous prime is 23302443431. The next prime is 23302443469. The reversal of 23302443433 is 33434420332.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22449628224 + 852815209 = 149832^2 + 29203^2 .
It is a cyclic number.
It is not a de Polignac number, because 23302443433 - 21 = 23302443431 is a prime.
Together with 23302443431, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 23302443395 and 23302443404.
It is not a weakly prime, because it can be changed into another prime (23302443431) 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 as a sum of consecutive naturals, namely, 11651221716 + 11651221717.
It is an arithmetic number, because the mean of its divisors is an integer number (11651221717).
Almost surely, 223302443433 is an apocalyptic number.
It is an amenable number.
23302443433 is a deficient number, since it is larger than the sum of its proper divisors (1).
23302443433 is an equidigital number, since it uses as much as digits as its factorization.
23302443433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62208, while the sum is 31.
Adding to 23302443433 its reverse (33434420332), we get a palindrome (56736863765).
The spelling of 23302443433 in words is "twenty-three billion, three hundred two million, four hundred forty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •