Base | Representation |
---|---|
bin | 1101011000110100100… |
… | …1000011010111101001 |
3 | 210222200011212221022220 |
4 | 3112031021003113221 |
5 | 12232020303232431 |
6 | 253354444304253 |
7 | 22421434113552 |
oct | 3261511032751 |
9 | 728604787286 |
10 | 230001227241 |
11 | 895a7773285 |
12 | 386aab42089 |
13 | 188c5a23a46 |
14 | b1bc769329 |
15 | 5eb2241b96 |
hex | 358d2435e9 |
230001227241 has 16 divisors (see below), whose sum is σ = 312473903040. Its totient is φ = 150431711040.
The previous prime is 230001227233. The next prime is 230001227263. The reversal of 230001227241 is 142722100032.
230001227241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 230001227241 - 23 = 230001227233 is a prime.
It is a super-2 number, since 2×2300012272412 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (230001227221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3307611 + ... + 3376431.
It is an arithmetic number, because the mean of its divisors is an integer number (19529618940).
Almost surely, 2230001227241 is an apocalyptic number.
It is an amenable number.
230001227241 is a deficient number, since it is larger than the sum of its proper divisors (82472675799).
230001227241 is a wasteful number, since it uses less digits than its factorization.
230001227241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89896.
The product of its (nonzero) digits is 1344, while the sum is 24.
Adding to 230001227241 its reverse (142722100032), we get a palindrome (372723327273).
The spelling of 230001227241 in words is "two hundred thirty billion, one million, two hundred twenty-seven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •