Base | Representation |
---|---|
bin | 11011011011000… |
… | …11101010011101 |
3 | 121000212120021202 |
4 | 31231203222131 |
5 | 432342440430 |
6 | 34454405245 |
7 | 5462235053 |
oct | 1555435235 |
9 | 530776252 |
10 | 230046365 |
11 | 10894526a |
12 | 65060825 |
13 | 38877413 |
14 | 227a41d3 |
15 | 152e1d45 |
hex | db63a9d |
230046365 has 4 divisors (see below), whose sum is σ = 276055644. Its totient is φ = 184037088.
The previous prime is 230046361. The next prime is 230046373. The reversal of 230046365 is 563640032.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 79959364 + 150087001 = 8942^2 + 12251^2 .
It is a cyclic number.
It is not a de Polignac number, because 230046365 - 22 = 230046361 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 (230046361) 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, 23004632 + ... + 23004641.
It is an arithmetic number, because the mean of its divisors is an integer number (69013911).
Almost surely, 2230046365 is an apocalyptic number.
It is an amenable number.
230046365 is a deficient number, since it is larger than the sum of its proper divisors (46009279).
230046365 is an equidigital number, since it uses as much as digits as its factorization.
230046365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46009278.
The product of its (nonzero) digits is 12960, while the sum is 29.
The square root of 230046365 is about 15167.2794198564. The cubic root of 230046365 is about 612.7337350333.
Adding to 230046365 its reverse (563640032), we get a palindrome (793686397).
The spelling of 230046365 in words is "two hundred thirty million, forty-six thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •