Base | Representation |
---|---|
bin | 11011011101110… |
… | …11000011110111 |
3 | 121001112202100012 |
4 | 31232323003313 |
5 | 432440414333 |
6 | 34510210435 |
7 | 5465255531 |
oct | 1556730367 |
9 | 531482305 |
10 | 230404343 |
11 | 10906a214 |
12 | 651b3a1b |
13 | 38971340 |
14 | 22858851 |
15 | 15362e48 |
hex | dbbb0f7 |
230404343 has 4 divisors (see below), whose sum is σ = 248127768. Its totient is φ = 212680920.
The previous prime is 230404337. The next prime is 230404367. The reversal of 230404343 is 343404032.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 230404343 - 220 = 229355767 is a prime.
It is a super-2 number, since 2×2304043432 = 106172322546523298, 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 (230404313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8861693 + ... + 8861718.
It is an arithmetic number, because the mean of its divisors is an integer number (62031942).
Almost surely, 2230404343 is an apocalyptic number.
230404343 is a deficient number, since it is larger than the sum of its proper divisors (17723425).
230404343 is a wasteful number, since it uses less digits than its factorization.
230404343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17723424.
The product of its (nonzero) digits is 3456, while the sum is 23.
The square root of 230404343 is about 15179.0758282578. The cubic root of 230404343 is about 613.0513978372.
Adding to 230404343 its reverse (343404032), we get a palindrome (573808375).
The spelling of 230404343 in words is "two hundred thirty million, four hundred four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •