Base | Representation |
---|---|
bin | 110100010101110110011111… |
… | …000101100110110111111001 |
3 | 1010012001220111222100011222221 |
4 | 310111312133011212313321 |
5 | 220133044130442223001 |
6 | 2133332233455444041 |
7 | 66326255241162145 |
oct | 6425663705466771 |
9 | 1105056458304887 |
10 | 230200031211001 |
11 | 67392315352915 |
12 | 2199a384826621 |
13 | 9b5aa01327537 |
14 | 40bba53298225 |
15 | 1b9306ee051a1 |
hex | d15d9f166df9 |
230200031211001 has 8 divisors (see below), whose sum is σ = 230608151280000. Its totient is φ = 229792155457680.
The previous prime is 230200031210987. The next prime is 230200031211047. The reversal of 230200031211001 is 100112130002032.
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 230200031211001 - 27 = 230200031210873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (230200031211701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59192751 + ... + 62961748.
It is an arithmetic number, because the mean of its divisors is an integer number (28826018910000).
Almost surely, 2230200031211001 is an apocalyptic number.
It is an amenable number.
230200031211001 is a deficient number, since it is larger than the sum of its proper divisors (408120068999).
230200031211001 is a wasteful number, since it uses less digits than its factorization.
230200031211001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122157839.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 230200031211001 its reverse (100112130002032), we get a palindrome (330312161213033).
The spelling of 230200031211001 in words is "two hundred thirty trillion, two hundred billion, thirty-one million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •