Base | Representation |
---|---|
bin | 11011011010110… |
… | …01111010100011 |
3 | 121000210112111212 |
4 | 31231121322203 |
5 | 432340201220 |
6 | 34453500335 |
7 | 5462010461 |
oct | 1555317243 |
9 | 530715455 |
10 | 230006435 |
11 | 10891826a |
12 | 650416ab |
13 | 388621a9 |
14 | 22793831 |
15 | 152d50c5 |
hex | db59ea3 |
230006435 has 4 divisors (see below), whose sum is σ = 276007728. Its totient is φ = 184005144.
The previous prime is 230006431. The next prime is 230006443. The reversal of 230006435 is 534600032.
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 230006435 - 22 = 230006431 is a prime.
It is a Duffinian number.
230006435 is a modest number, since divided by 6435 gives 230 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 230006435.
It is not an unprimeable number, because it can be changed into a prime (230006431) 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 3 ways as a sum of consecutive naturals, for example, 23000639 + ... + 23000648.
It is an arithmetic number, because the mean of its divisors is an integer number (69001932).
Almost surely, 2230006435 is an apocalyptic number.
230006435 is a deficient number, since it is larger than the sum of its proper divisors (46001293).
230006435 is an equidigital number, since it uses as much as digits as its factorization.
230006435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46001292.
The product of its (nonzero) digits is 2160, while the sum is 23.
The square root of 230006435 is about 15165.9630422865. The cubic root of 230006435 is about 612.6982814937.
Adding to 230006435 its reverse (534600032), we get a palindrome (764606467).
The spelling of 230006435 in words is "two hundred thirty million, six thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •