Base | Representation |
---|---|
bin | 110100010101001011001100… |
… | …001011001010110000000111 |
3 | 1010011220110112010120112112201 |
4 | 310111023030023022300013 |
5 | 220131313424002100033 |
6 | 2133255024504055331 |
7 | 66323021231011354 |
oct | 6425131413126007 |
9 | 1104813463515481 |
10 | 230153543003143 |
11 | 67374629a31221 |
12 | 2199136ba64547 |
13 | 9b56502cc2636 |
14 | 40b96c311562b |
15 | 1b91c4d9eb47d |
hex | d152cc2cac07 |
230153543003143 has 4 divisors (see below), whose sum is σ = 230185040689800. Its totient is φ = 230122045316488.
The previous prime is 230153543003119. The next prime is 230153543003183. The reversal of 230153543003143 is 341300345351032.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-230153543003143 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230153543003183) 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, 15748832368 + ... + 15748846981.
It is an arithmetic number, because the mean of its divisors is an integer number (57546260172450).
Almost surely, 2230153543003143 is an apocalyptic number.
230153543003143 is a deficient number, since it is larger than the sum of its proper divisors (31497686657).
230153543003143 is an equidigital number, since it uses as much as digits as its factorization.
230153543003143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31497686656.
The product of its (nonzero) digits is 194400, while the sum is 37.
Adding to 230153543003143 its reverse (341300345351032), we get a palindrome (571453888354175).
The spelling of 230153543003143 in words is "two hundred thirty trillion, one hundred fifty-three billion, five hundred forty-three million, three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •