Base | Representation |
---|---|
bin | 110111011110011011110010… |
… | …011000011001110011100001 |
3 | 1011222212122021222100101220121 |
4 | 313132123302120121303201 |
5 | 223434413142021400001 |
6 | 2222524405323440241 |
7 | 102251155303522141 |
oct | 6736336230316341 |
9 | 1158778258311817 |
10 | 243983978700001 |
11 | 7081702a366191 |
12 | 23445890986081 |
13 | a61a78a34baa7 |
14 | 4436c5d724921 |
15 | 1d318b34646a1 |
hex | dde6f2619ce1 |
243983978700001 has 4 divisors (see below), whose sum is σ = 244070100827332. Its totient is φ = 243897856572672.
The previous prime is 243983978699963. The next prime is 243983978700109. The reversal of 243983978700001 is 100007879389342.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 75341549362401 + 168642429337600 = 8679951^2 + 12986240^2 .
It is a cyclic number.
It is not a de Polignac number, because 243983978700001 - 27 = 243983978699873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (243983978700601) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43061059416 + ... + 43061065081.
It is an arithmetic number, because the mean of its divisors is an integer number (61017525206833).
Almost surely, 2243983978700001 is an apocalyptic number.
It is an amenable number.
243983978700001 is a deficient number, since it is larger than the sum of its proper divisors (86122127331).
243983978700001 is an equidigital number, since it uses as much as digits as its factorization.
243983978700001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86122127330.
The product of its (nonzero) digits is 18289152, while the sum is 61.
The spelling of 243983978700001 in words is "two hundred forty-three trillion, nine hundred eighty-three billion, nine hundred seventy-eight million, seven hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •