Base | Representation |
---|---|
bin | 1101011001111110010… |
… | …0001010110111110011 |
3 | 211000110201111202202201 |
4 | 3112133210022313303 |
5 | 12233133420410442 |
6 | 253445245324031 |
7 | 22432206316435 |
oct | 3263744126763 |
9 | 730421452681 |
10 | 230310325747 |
11 | 897461a1597 |
12 | 38776566617 |
13 | 18944a88c78 |
14 | b20b82a655 |
15 | 5ece44b7b7 |
hex | 359f90adf3 |
230310325747 has 4 divisors (see below), whose sum is σ = 230317581240. Its totient is φ = 230303070256.
The previous prime is 230310325727. The next prime is 230310325753. The reversal of 230310325747 is 747523013032.
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 230310325747 - 223 = 230301937139 is a prime.
It is a super-2 number, since 2×2303103257472 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (230310325717) 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 3 ways as a sum of consecutive naturals, for example, 3579922 + ... + 3643687.
It is an arithmetic number, because the mean of its divisors is an integer number (57579395310).
Almost surely, 2230310325747 is an apocalyptic number.
230310325747 is a deficient number, since it is larger than the sum of its proper divisors (7255493).
230310325747 is an equidigital number, since it uses as much as digits as its factorization.
230310325747 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7255492.
The product of its (nonzero) digits is 105840, while the sum is 37.
Adding to 230310325747 its reverse (747523013032), we get a palindrome (977833338779).
The spelling of 230310325747 in words is "two hundred thirty billion, three hundred ten million, three hundred twenty-five thousand, seven hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •