Base | Representation |
---|---|
bin | 101100010000… |
… | …1111001100001 |
3 | 1121200001201211 |
4 | 1120201321201 |
5 | 21420120041 |
6 | 2145230121 |
7 | 401155261 |
oct | 130417141 |
9 | 47601654 |
10 | 23207521 |
11 | 12111177 |
12 | 7932341 |
13 | 4a6737c |
14 | 31217a1 |
15 | 2086481 |
hex | 1621e61 |
23207521 has 2 divisors, whose sum is σ = 23207522. Its totient is φ = 23207520.
The previous prime is 23207497. The next prime is 23207537. The reversal of 23207521 is 12570232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14440000 + 8767521 = 3800^2 + 2961^2 .
It is a cyclic number.
It is not a de Polignac number, because 23207521 - 211 = 23205473 is a prime.
It is a Chen prime.
It is equal to p1460461 and since 23207521 and 1460461 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 23207492 and 23207501.
It is not a weakly prime, because it can be changed into another prime (23207581) 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, 11603760 + 11603761.
It is an arithmetic number, because the mean of its divisors is an integer number (11603761).
Almost surely, 223207521 is an apocalyptic number.
It is an amenable number.
23207521 is a deficient number, since it is larger than the sum of its proper divisors (1).
23207521 is an equidigital number, since it uses as much as digits as its factorization.
23207521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 22.
The square root of 23207521 is about 4817.4184995701. The cubic root of 23207521 is about 285.2394458415.
Adding to 23207521 its reverse (12570232), we get a palindrome (35777753).
The spelling of 23207521 in words is "twenty-three million, two hundred seven thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •