Base | Representation |
---|---|
bin | 1000100101011010… |
… | …0101111101000111 |
3 | 12221121010201012110 |
4 | 2021112211331013 |
5 | 14204411314343 |
6 | 1020355152103 |
7 | 111051041625 |
oct | 21126457507 |
9 | 5847121173 |
10 | 2304401223 |
11 | a82857823 |
12 | 5438a5633 |
13 | 2a9556527 |
14 | 17c096515 |
15 | d7490833 |
hex | 895a5f47 |
2304401223 has 8 divisors (see below), whose sum is σ = 3074080000. Its totient is φ = 1535494968.
The previous prime is 2304401207. The next prime is 2304401227. The reversal of 2304401223 is 3221044032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2304401223 - 24 = 2304401207 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2304401223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2304401227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 186133 + ... + 198126.
It is an arithmetic number, because the mean of its divisors is an integer number (384260000).
Almost surely, 22304401223 is an apocalyptic number.
2304401223 is a deficient number, since it is larger than the sum of its proper divisors (769678777).
2304401223 is a wasteful number, since it uses less digits than its factorization.
2304401223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 386261.
The product of its (nonzero) digits is 1152, while the sum is 21.
The square root of 2304401223 is about 48004.1792243134. The cubic root of 2304401223 is about 1320.8475623045.
Adding to 2304401223 its reverse (3221044032), we get a palindrome (5525445255).
The spelling of 2304401223 in words is "two billion, three hundred four million, four hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.257 sec. • engine limits •