Base | Representation |
---|---|
bin | 1010100100011000101000… |
… | …11101001001010110001001 |
3 | 10001021202120012212022121021 |
4 | 11102030110131021112021 |
5 | 11021232330233122213 |
6 | 121232255244312441 |
7 | 4616031024661645 |
oct | 522142435112611 |
9 | 101252505768537 |
10 | 23240411223433 |
11 | 7450226294228 |
12 | 2734192842721 |
13 | cc773b456321 |
14 | 5a4bb0289c25 |
15 | 2a480a6b4d8d |
hex | 152314749589 |
23240411223433 has 2 divisors, whose sum is σ = 23240411223434. Its totient is φ = 23240411223432.
The previous prime is 23240411223391. The next prime is 23240411223457. The reversal of 23240411223433 is 33432211404232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22580477579664 + 659933643769 = 4751892^2 + 812363^2 .
It is a cyclic number.
It is not a de Polignac number, because 23240411223433 - 237 = 23102972269961 is a prime.
It is not a weakly prime, because it can be changed into another prime (23240411223473) 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, 11620205611716 + 11620205611717.
It is an arithmetic number, because the mean of its divisors is an integer number (11620205611717).
Almost surely, 223240411223433 is an apocalyptic number.
It is an amenable number.
23240411223433 is a deficient number, since it is larger than the sum of its proper divisors (1).
23240411223433 is an equidigital number, since it uses as much as digits as its factorization.
23240411223433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 82944, while the sum is 34.
Adding to 23240411223433 its reverse (33432211404232), we get a palindrome (56672622627665).
The spelling of 23240411223433 in words is "twenty-three trillion, two hundred forty billion, four hundred eleven million, two hundred twenty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •