Base | Representation |
---|---|
bin | 101100100010… |
… | …1100011000101 |
3 | 1121221111000222 |
4 | 1121011203011 |
5 | 21434303131 |
6 | 2152314125 |
7 | 402334061 |
oct | 131054305 |
9 | 47844028 |
10 | 23353541 |
11 | 12200952 |
12 | 79a2945 |
13 | 4ab8983 |
14 | 315caa1 |
15 | 20b487b |
hex | 16458c5 |
23353541 has 2 divisors, whose sum is σ = 23353542. Its totient is φ = 23353540.
The previous prime is 23353513. The next prime is 23353543. The reversal of 23353541 is 14535332.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12397441 + 10956100 = 3521^2 + 3310^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23353541 is a prime.
Together with 23353543, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 23353541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23353543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11676770 + 11676771.
It is an arithmetic number, because the mean of its divisors is an integer number (11676771).
Almost surely, 223353541 is an apocalyptic number.
It is an amenable number.
23353541 is a deficient number, since it is larger than the sum of its proper divisors (1).
23353541 is an equidigital number, since it uses as much as digits as its factorization.
23353541 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5400, while the sum is 26.
The square root of 23353541 is about 4832.5501549389. The cubic root of 23353541 is about 285.8364306676.
Adding to 23353541 its reverse (14535332), we get a palindrome (37888873).
The spelling of 23353541 in words is "twenty-three million, three hundred fifty-three thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •