Base | Representation |
---|---|
bin | 101100010001… |
… | …0101011110011 |
3 | 1121200020011000 |
4 | 1120202223303 |
5 | 21420220424 |
6 | 2145253043 |
7 | 401200536 |
oct | 130425363 |
9 | 47606130 |
10 | 23210739 |
11 | 12113632 |
12 | 7934183 |
13 | 4a68986 |
14 | 3122a1d |
15 | 20873c9 |
hex | 1622af3 |
23210739 has 8 divisors (see below), whose sum is σ = 34386320. Its totient is φ = 15473808.
The previous prime is 23210731. The next prime is 23210771. The reversal of 23210739 is 93701232.
It is not a de Polignac number, because 23210739 - 23 = 23210731 is a prime.
It is a super-2 number, since 2×232107392 = 1077476809852242, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 859657 = 23210739 / (2 + 3 + 2 + 1 + 0 + 7 + 3 + 9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23210731) 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, 429802 + ... + 429855.
It is an arithmetic number, because the mean of its divisors is an integer number (4298290).
Almost surely, 223210739 is an apocalyptic number.
23210739 is a deficient number, since it is larger than the sum of its proper divisors (11175581).
23210739 is an equidigital number, since it uses as much as digits as its factorization.
23210739 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 859666 (or 859660 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 27.
The square root of 23210739 is about 4817.7524843022. The cubic root of 23210739 is about 285.2526291843.
The spelling of 23210739 in words is "twenty-three million, two hundred ten thousand, seven hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •