Base | Representation |
---|---|
bin | 1101011001001111010… |
… | …1000111000100011111 |
3 | 210222222000000221100011 |
4 | 3112103311013010133 |
5 | 12232233020040111 |
6 | 253413533344051 |
7 | 22424265652546 |
oct | 3262365070437 |
9 | 728860027304 |
10 | 230113440031 |
11 | 89655046422 |
12 | 38720638027 |
13 | 18913052347 |
14 | b1cd61915d |
15 | 5ebc00a021 |
hex | 3593d4711f |
230113440031 has 8 divisors (see below), whose sum is σ = 236340298064. Its totient is φ = 223886980800.
The previous prime is 230113440001. The next prime is 230113440041. The reversal of 230113440031 is 130044311032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 230113440031 - 25 = 230113439999 is a prime.
It is a super-2 number, since 2×2301134400312 (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 = 230113439984 and 230113440011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230113440001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1352056 + ... + 1512706.
It is an arithmetic number, because the mean of its divisors is an integer number (29542537258).
Almost surely, 2230113440031 is an apocalyptic number.
230113440031 is a deficient number, since it is larger than the sum of its proper divisors (6226858033).
230113440031 is a wasteful number, since it uses less digits than its factorization.
230113440031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199401.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 230113440031 its reverse (130044311032), we get a palindrome (360157751063).
The spelling of 230113440031 in words is "two hundred thirty billion, one hundred thirteen million, four hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •