Base | Representation |
---|---|
bin | 101100010110… |
… | …0011010001001 |
3 | 1121202020210012 |
4 | 1120230122021 |
5 | 21423004234 |
6 | 2150201305 |
7 | 401424626 |
oct | 130543211 |
9 | 47666705 |
10 | 23250569 |
11 | 12140551 |
12 | 7953235 |
13 | 4a80b44 |
14 | 313334d |
15 | 20940ce |
hex | 162c689 |
23250569 has 4 divisors (see below), whose sum is σ = 23544960. Its totient is φ = 22956180.
The previous prime is 23250511. The next prime is 23250581. The reversal of 23250569 is 96505232.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 23250569 - 28 = 23250313 is a prime.
It is a super-2 number, since 2×232505692 = 1081177917647522, which contains 22 as substring.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (23250869) 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, 147077 + ... + 147234.
It is an arithmetic number, because the mean of its divisors is an integer number (5886240).
Almost surely, 223250569 is an apocalyptic number.
It is an amenable number.
23250569 is a deficient number, since it is larger than the sum of its proper divisors (294391).
23250569 is an equidigital number, since it uses as much as digits as its factorization.
23250569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294390.
The product of its (nonzero) digits is 16200, while the sum is 32.
The square root of 23250569 is about 4821.8843826869. The cubic root of 23250569 is about 285.4157019687.
The spelling of 23250569 in words is "twenty-three million, two hundred fifty thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •