Base | Representation |
---|---|
bin | 110100010100111111111010… |
… | …010000101100111110110001 |
3 | 1010011212022021001021110221011 |
4 | 310110333322100230332301 |
5 | 220131114122403212423 |
6 | 2133245303004230521 |
7 | 66322112132165440 |
oct | 6424777220547661 |
9 | 1104768231243834 |
10 | 230141431304113 |
11 | 6736a4842184aa |
12 | 2198ab4b83b441 |
13 | 9b5532297c314 |
14 | 40b8c9473cd57 |
15 | 1b91790564b0d |
hex | d14ffa42cfb1 |
230141431304113 has 8 divisors (see below), whose sum is σ = 263091215671040. Its totient is φ = 197209756196640.
The previous prime is 230141431304089. The next prime is 230141431304119. The reversal of 230141431304113 is 311403134141032.
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 230141431304113 - 213 = 230141431295921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (230141431304119) 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, 4527287628 + ... + 4527338461.
It is an arithmetic number, because the mean of its divisors is an integer number (32886401958880).
Almost surely, 2230141431304113 is an apocalyptic number.
It is an amenable number.
230141431304113 is a deficient number, since it is larger than the sum of its proper divisors (32949784366927).
230141431304113 is an equidigital number, since it uses as much as digits as its factorization.
230141431304113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9054629727.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 230141431304113 its reverse (311403134141032), we get a palindrome (541544565445145).
The spelling of 230141431304113 in words is "two hundred thirty trillion, one hundred forty-one billion, four hundred thirty-one million, three hundred four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •