Base | Representation |
---|---|
bin | 101011111100… |
… | …1000100000001 |
3 | 1121100120021212 |
4 | 1113321010001 |
5 | 21344242012 |
6 | 2141455505 |
7 | 366560522 |
oct | 127710401 |
9 | 47316255 |
10 | 23040257 |
11 | 12007539 |
12 | 7871595 |
13 | 4a091b6 |
14 | 30ba849 |
15 | 2051b22 |
hex | 15f9101 |
23040257 has 4 divisors (see below), whose sum is σ = 23098116. Its totient is φ = 22982400.
The previous prime is 23040247. The next prime is 23040263. The reversal of 23040257 is 75204032.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 20757136 + 2283121 = 4556^2 + 1511^2 .
It is a cyclic number.
It is not a de Polignac number, because 23040257 - 214 = 23023873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23040247) 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 in 3 ways as a sum of consecutive naturals, for example, 28328 + ... + 29129.
It is an arithmetic number, because the mean of its divisors is an integer number (5774529).
Almost surely, 223040257 is an apocalyptic number.
It is an amenable number.
23040257 is a deficient number, since it is larger than the sum of its proper divisors (57859).
23040257 is an equidigital number, since it uses as much as digits as its factorization.
23040257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57858.
The product of its (nonzero) digits is 1680, while the sum is 23.
The square root of 23040257 is about 4800.0267707587. The cubic root of 23040257 is about 284.5525223664.
Adding to 23040257 its reverse (75204032), we get a palindrome (98244289).
It can be divided in two parts, 2304025 and 7, that added together give a palindrome (2304032).
The spelling of 23040257 in words is "twenty-three million, forty thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •