Base | Representation |
---|---|
bin | 110100010110001100000101… |
… | …010001000101011000001011 |
3 | 1010012011010101001202120212211 |
4 | 310112030011101011120023 |
5 | 220133434123401111133 |
6 | 2133351030511045551 |
7 | 66331036006356061 |
oct | 6426140521053013 |
9 | 1105133331676784 |
10 | 230223220332043 |
11 | 673a1134a74764 |
12 | 219a29768108b7 |
13 | 9b5cc58632033 |
14 | 40bcc12d36031 |
15 | 1b9397ab20bcd |
hex | d1630544560b |
230223220332043 has 2 divisors, whose sum is σ = 230223220332044. Its totient is φ = 230223220332042.
The previous prime is 230223220331953. The next prime is 230223220332071. The reversal of 230223220332043 is 340233022322032.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-230223220332043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 230223220331996 and 230223220332014.
It is not a weakly prime, because it can be changed into another prime (230223220342043) 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, 115111610166021 + 115111610166022.
It is an arithmetic number, because the mean of its divisors is an integer number (115111610166022).
Almost surely, 2230223220332043 is an apocalyptic number.
230223220332043 is a deficient number, since it is larger than the sum of its proper divisors (1).
230223220332043 is an equidigital number, since it uses as much as digits as its factorization.
230223220332043 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 230223220332043 its reverse (340233022322032), we get a palindrome (570456242654075).
The spelling of 230223220332043 in words is "two hundred thirty trillion, two hundred twenty-three billion, two hundred twenty million, three hundred thirty-two thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •