Base | Representation |
---|---|
bin | 110111010011100000100000… |
… | …011100000110111000011001 |
3 | 1011220012212020012002110001101 |
4 | 313103200200130012320121 |
5 | 223340112423312134301 |
6 | 2221151431444151401 |
7 | 102143004522234031 |
oct | 6723404034067031 |
9 | 1156185205073041 |
10 | 243233132146201 |
11 | 705576570270aa |
12 | 23344263998561 |
13 | a594a2a93c632 |
14 | 440c7914c68c1 |
15 | 1d1c0ba546701 |
hex | dd3820706e19 |
243233132146201 has 8 divisors (see below), whose sum is σ = 247881009772224. Its totient is φ = 238587423899760.
The previous prime is 243233132146181. The next prime is 243233132146217. The reversal of 243233132146201 is 102641231332342.
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 243233132146201 - 27 = 243233132146073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (243233132146261) 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, 542118511 + ... + 542566996.
It is an arithmetic number, because the mean of its divisors is an integer number (30985126221528).
Almost surely, 2243233132146201 is an apocalyptic number.
It is an amenable number.
243233132146201 is a deficient number, since it is larger than the sum of its proper divisors (4647877626023).
243233132146201 is a wasteful number, since it uses less digits than its factorization.
243233132146201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1084689791.
The product of its (nonzero) digits is 124416, while the sum is 37.
Adding to 243233132146201 its reverse (102641231332342), we get a palindrome (345874363478543).
The spelling of 243233132146201 in words is "two hundred forty-three trillion, two hundred thirty-three billion, one hundred thirty-two million, one hundred forty-six thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •