Base | Representation |
---|---|
bin | 1101011001101011001… |
… | …1011001100011111101 |
3 | 211000021011011202010221 |
4 | 3112122303121203331 |
5 | 12233002442310442 |
6 | 253433313101341 |
7 | 22430216245156 |
oct | 3263263314375 |
9 | 730234152127 |
10 | 230230431997 |
11 | 897050931a5 |
12 | 38753857851 |
13 | 18931365067 |
14 | b200d9092d |
15 | 5ec7419467 |
hex | 359acd98fd |
230230431997 has 8 divisors (see below), whose sum is σ = 235297556312. Its totient is φ = 225205012800.
The previous prime is 230230431989. The next prime is 230230432027. The reversal of 230230431997 is 799134032032.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 38986897401 + 191243534596 = 197451^2 + 437314^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 230230431997 - 23 = 230230431989 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230230434997) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10415118 + ... + 10437199.
It is an arithmetic number, because the mean of its divisors is an integer number (29412194539).
Almost surely, 2230230431997 is an apocalyptic number.
It is an amenable number.
230230431997 is a deficient number, since it is larger than the sum of its proper divisors (5067124315).
230230431997 is a wasteful number, since it uses less digits than its factorization.
230230431997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20852559.
The product of its (nonzero) digits is 244944, while the sum is 43.
The spelling of 230230431997 in words is "two hundred thirty billion, two hundred thirty million, four hundred thirty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •