Base | Representation |
---|---|
bin | 1101011001110000011… |
… | …1101100100111011101 |
3 | 211000022200202110002201 |
4 | 3112130013230213131 |
5 | 12233024121431031 |
6 | 253435422451501 |
7 | 22430605133224 |
oct | 3263407544735 |
9 | 730280673081 |
10 | 230252530141 |
11 | 89716606927 |
12 | 3875b133b91 |
13 | 18935b0149a |
14 | b203ca3cbb |
15 | 5ec9331d61 |
hex | 359c1ec9dd |
230252530141 has 4 divisors (see below), whose sum is σ = 235151520192. Its totient is φ = 225353540092.
The previous prime is 230252530111. The next prime is 230252530147. The reversal of 230252530141 is 141035252032.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 230252530141 - 215 = 230252497373 is a prime.
It is a super-2 number, since 2×2302525301412 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230252530147) 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, 2449494955 + ... + 2449495048.
It is an arithmetic number, because the mean of its divisors is an integer number (58787880048).
Almost surely, 2230252530141 is an apocalyptic number.
It is an amenable number.
230252530141 is a deficient number, since it is larger than the sum of its proper divisors (4898990051).
230252530141 is an equidigital number, since it uses as much as digits as its factorization.
230252530141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4898990050.
The product of its (nonzero) digits is 7200, while the sum is 28.
Adding to 230252530141 its reverse (141035252032), we get a palindrome (371287782173).
The spelling of 230252530141 in words is "two hundred thirty billion, two hundred fifty-two million, five hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •