Base | Representation |
---|---|
bin | 11011011010111… |
… | …01001110110111 |
3 | 121000211020011010 |
4 | 31231131032313 |
5 | 432341120043 |
6 | 34454043303 |
7 | 5462065212 |
oct | 1555351667 |
9 | 530736133 |
10 | 230020023 |
11 | 1089274a2 |
12 | 65049533 |
13 | 3886842c |
14 | 22798779 |
15 | 152d9133 |
hex | db5d3b7 |
230020023 has 8 divisors (see below), whose sum is σ = 322835200. Its totient is φ = 145275768.
The previous prime is 230020003. The next prime is 230020039. The reversal of 230020023 is 320020032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 230020023 - 29 = 230019511 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 230019990 and 230020008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230020003) 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 7 ways as a sum of consecutive naturals, for example, 2017663 + ... + 2017776.
It is an arithmetic number, because the mean of its divisors is an integer number (40354400).
Almost surely, 2230020023 is an apocalyptic number.
230020023 is a deficient number, since it is larger than the sum of its proper divisors (92815177).
230020023 is a wasteful number, since it uses less digits than its factorization.
230020023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4035461.
The product of its (nonzero) digits is 72, while the sum is 12.
The square root of 230020023 is about 15166.4110124973. The cubic root of 230020023 is about 612.7103466349.
Adding to 230020023 its reverse (320020032), we get a palindrome (550040055).
Subtracting 230020023 from its reverse (320020032), we obtain a palindrome (90000009).
The spelling of 230020023 in words is "two hundred thirty million, twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •