Base | Representation |
---|---|
bin | 1010011110010110111000… |
… | …10010001111111010010001 |
3 | 10000112222000000011001121212 |
4 | 11033023130102033322101 |
5 | 11004334204431144213 |
6 | 120553205015225505 |
7 | 4565046622065026 |
oct | 517133422177221 |
9 | 100488000131555 |
10 | 23033310412433 |
11 | 7380410283692 |
12 | 2700015078295 |
13 | cb1054c95549 |
14 | 598b650c954d |
15 | 29e238b619a8 |
hex | 14f2dc48fe91 |
23033310412433 has 2 divisors, whose sum is σ = 23033310412434. Its totient is φ = 23033310412432.
The previous prime is 23033310412327. The next prime is 23033310412471. The reversal of 23033310412433 is 33421401333032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14508732395089 + 8524578017344 = 3809033^2 + 2919688^2 .
It is a cyclic number.
It is not a de Polignac number, because 23033310412433 - 212 = 23033310408337 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 23033310412433.
It is not a weakly prime, because it can be changed into another prime (23033310412933) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11516655206216 + 11516655206217.
It is an arithmetic number, because the mean of its divisors is an integer number (11516655206217).
Almost surely, 223033310412433 is an apocalyptic number.
It is an amenable number.
23033310412433 is a deficient number, since it is larger than the sum of its proper divisors (1).
23033310412433 is an equidigital number, since it uses as much as digits as its factorization.
23033310412433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 46656, while the sum is 32.
Adding to 23033310412433 its reverse (33421401333032), we get a palindrome (56454711745465).
The spelling of 23033310412433 in words is "twenty-three trillion, thirty-three billion, three hundred ten million, four hundred twelve thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •