Base | Representation |
---|---|
bin | 101100000110… |
… | …1100100100101 |
3 | 1121111211112010 |
4 | 1120031210211 |
5 | 21404434021 |
6 | 2143344433 |
7 | 400360446 |
oct | 130154445 |
9 | 47454463 |
10 | 23124261 |
11 | 12064666 |
12 | 78b2119 |
13 | 4a384c4 |
14 | 30dd2cd |
15 | 206b976 |
hex | 160d925 |
23124261 has 4 divisors (see below), whose sum is σ = 30832352. Its totient is φ = 15416172.
The previous prime is 23124259. The next prime is 23124293. The reversal of 23124261 is 16242132.
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 not a de Polignac number, because 23124261 - 21 = 23124259 is a prime.
It is a super-2 number, since 2×231242612 = 1069462893592242, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23124961) 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, 3854041 + ... + 3854046.
It is an arithmetic number, because the mean of its divisors is an integer number (7708088).
Almost surely, 223124261 is an apocalyptic number.
It is an amenable number.
23124261 is a deficient number, since it is larger than the sum of its proper divisors (7708091).
23124261 is an equidigital number, since it uses as much as digits as its factorization.
23124261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7708090.
The product of its digits is 576, while the sum is 21.
The square root of 23124261 is about 4808.7691772428. The cubic root of 23124261 is about 284.8979258960.
Adding to 23124261 its reverse (16242132), we get a palindrome (39366393).
The spelling of 23124261 in words is "twenty-three million, one hundred twenty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •