Base | Representation |
---|---|
bin | 110111010011001111101011… |
… | …010000100010100010010101 |
3 | 1011220011010120201020221112110 |
4 | 313103033223100202202111 |
5 | 223334313420333131432 |
6 | 2221135242304341233 |
7 | 102141464630044056 |
oct | 6723175320424225 |
9 | 1156133521227473 |
10 | 243215060052117 |
11 | 7054aa2288335a |
12 | 2334085b614819 |
13 | a59310a7b933a |
14 | 440b95929072d |
15 | 1d1b8adb9bdcc |
hex | dd33eb422895 |
243215060052117 has 8 divisors (see below), whose sum is σ = 324286819175200. Its totient is φ = 162143337148560.
The previous prime is 243215060052079. The next prime is 243215060052197. The reversal of 243215060052117 is 711250060512342.
243215060052117 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 243215060052117 - 26 = 243215060052053 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 (243215060052197) 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, 19281642 + ... + 29295252.
It is an arithmetic number, because the mean of its divisors is an integer number (40535852396900).
Almost surely, 2243215060052117 is an apocalyptic number.
It is an amenable number.
243215060052117 is a deficient number, since it is larger than the sum of its proper divisors (81071759123083).
243215060052117 is a wasteful number, since it uses less digits than its factorization.
243215060052117 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18109763.
The product of its (nonzero) digits is 100800, while the sum is 39.
The spelling of 243215060052117 in words is "two hundred forty-three trillion, two hundred fifteen billion, sixty million, fifty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •