Base | Representation |
---|---|
bin | 110111010011111111011001… |
… | …011010011010111011010101 |
3 | 1011220100000211201202012121120 |
4 | 313103333121122122323111 |
5 | 223341133340331310203 |
6 | 2221214555012034153 |
7 | 102145260461450310 |
oct | 6723773132327325 |
9 | 1156300751665546 |
10 | 243266300260053 |
11 | 7056a727614a44 |
12 | 2334a77b902959 |
13 | a597bb548a8c5 |
14 | 441021a5b9977 |
15 | 1d1cdac370b53 |
hex | dd3fd969aed5 |
243266300260053 has 16 divisors (see below), whose sum is σ = 374092344658560. Its totient is φ = 137733999621696.
The previous prime is 243266300260037. The next prime is 243266300260091. The reversal of 243266300260053 is 350062003662342.
It is a happy number.
It is not a de Polignac number, because 243266300260053 - 24 = 243266300260037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 243266300259987 and 243266300260014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (243266300260013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53138114850 + ... + 53138119427.
It is an arithmetic number, because the mean of its divisors is an integer number (23380771541160).
Almost surely, 2243266300260053 is an apocalyptic number.
It is an amenable number.
243266300260053 is a deficient number, since it is larger than the sum of its proper divisors (130826044398507).
243266300260053 is a wasteful number, since it uses less digits than its factorization.
243266300260053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106276234396.
The product of its (nonzero) digits is 933120, while the sum is 42.
The spelling of 243266300260053 in words is "two hundred forty-three trillion, two hundred sixty-six billion, three hundred million, two hundred sixty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •