Base | Representation |
---|---|
bin | 10101101110001010… |
… | …010011100111101001 |
3 | 2020012102101210020112 |
4 | 111232022103213221 |
5 | 340231144011131 |
6 | 14414153304105 |
7 | 1453652333651 |
oct | 255612234751 |
9 | 66172353215 |
10 | 23323032041 |
11 | 99892751a1 |
12 | 462aa05035 |
13 | 2278c9249a |
14 | 11b3779361 |
15 | 91786d02b |
hex | 56e2939e9 |
23323032041 has 2 divisors, whose sum is σ = 23323032042. Its totient is φ = 23323032040.
The previous prime is 23323031923. The next prime is 23323032043. The reversal of 23323032041 is 14023032332.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17847624025 + 5475408016 = 133595^2 + 73996^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23323032041 is a prime.
Together with 23323032043, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 23323031998 and 23323032016.
It is not a weakly prime, because it can be changed into another prime (23323032043) 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, 11661516020 + 11661516021.
It is an arithmetic number, because the mean of its divisors is an integer number (11661516021).
Almost surely, 223323032041 is an apocalyptic number.
It is an amenable number.
23323032041 is a deficient number, since it is larger than the sum of its proper divisors (1).
23323032041 is an equidigital number, since it uses as much as digits as its factorization.
23323032041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 23323032041 its reverse (14023032332), we get a palindrome (37346064373).
The spelling of 23323032041 in words is "twenty-three billion, three hundred twenty-three million, thirty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •