Base | Representation |
---|---|
bin | 101101000011… |
… | …0000111111001 |
3 | 1122102220212021 |
4 | 1122012013321 |
5 | 22021234131 |
6 | 2202114441 |
7 | 404515156 |
oct | 132060771 |
9 | 48386767 |
10 | 23618041 |
11 | 12371647 |
12 | 7aaba21 |
13 | 4b7c195 |
14 | 31cb22d |
15 | 2117e11 |
hex | 16861f9 |
23618041 has 8 divisors (see below), whose sum is σ = 24101384. Its totient is φ = 23137920.
The previous prime is 23618029. The next prime is 23618047. The reversal of 23618041 is 14081632.
It can be written as a sum of positive squares in 4 ways, for example, as 385641 + 23232400 = 621^2 + 4820^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23618041 - 213 = 23609849 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23617997 and 23618015.
It is not an unprimeable number, because it can be changed into a prime (23618047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18475 + ... + 19711.
It is an arithmetic number, because the mean of its divisors is an integer number (3012673).
Almost surely, 223618041 is an apocalyptic number.
It is an amenable number.
23618041 is a deficient number, since it is larger than the sum of its proper divisors (483343).
23618041 is a wasteful number, since it uses less digits than its factorization.
23618041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1611.
The product of its (nonzero) digits is 1152, while the sum is 25.
The square root of 23618041 is about 4859.8396064068. The cubic root of 23618041 is about 286.9115009177.
Adding to 23618041 its reverse (14081632), we get a palindrome (37699673).
The spelling of 23618041 in words is "twenty-three million, six hundred eighteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •