Base | Representation |
---|---|
bin | 1101011010000101101… |
… | …0011100110000111111 |
3 | 211000112212212001101121 |
4 | 3112201122130300333 |
5 | 12233214340111111 |
6 | 253452314051411 |
7 | 22433034005656 |
oct | 3264132346077 |
9 | 730485761347 |
10 | 230341332031 |
11 | 8976174a018 |
12 | 38784a19b67 |
13 | 1894b323c95 |
14 | b2119bc19d |
15 | 5ed2023871 |
hex | 35a169cc3f |
230341332031 has 4 divisors (see below), whose sum is σ = 230781755752. Its totient is φ = 229900908312.
The previous prime is 230341331953. The next prime is 230341332041. The reversal of 230341332031 is 130233143032.
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 230341332031 - 231 = 228193848383 is a prime.
It is a super-2 number, since 2×2303413320312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 230341331987 and 230341332005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230341332041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 220211076 + ... + 220212121.
It is an arithmetic number, because the mean of its divisors is an integer number (57695438938).
Almost surely, 2230341332031 is an apocalyptic number.
230341332031 is a deficient number, since it is larger than the sum of its proper divisors (440423721).
230341332031 is an equidigital number, since it uses as much as digits as its factorization.
230341332031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440423720.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 230341332031 its reverse (130233143032), we get a palindrome (360574475063).
The spelling of 230341332031 in words is "two hundred thirty billion, three hundred forty-one million, three hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •