Base | Representation |
---|---|
bin | 110111010110111011101110… |
… | …101100100110000110101011 |
3 | 1011221001100210211101110102221 |
4 | 313112323232230212012223 |
5 | 223402442012311341000 |
6 | 2221451521104134511 |
7 | 102166006624656505 |
oct | 6726735654460653 |
9 | 1157040724343387 |
10 | 243468520808875 |
11 | 7063846887035a |
12 | 233819b7007437 |
13 | a5b0ca185459b |
14 | 4419d21566d75 |
15 | 1d2329572061a |
hex | dd6eeeb261ab |
243468520808875 has 16 divisors (see below), whose sum is σ = 308829840437664. Its totient is φ = 191581786860000.
The previous prime is 243468520808827. The next prime is 243468520808917. The reversal of 243468520808875 is 578808025864342.
It is a happy number.
It is not a de Polignac number, because 243468520808875 - 213 = 243468520800683 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 15965141281 + ... + 15965156530.
It is an arithmetic number, because the mean of its divisors is an integer number (19301865027354).
Almost surely, 2243468520808875 is an apocalyptic number.
243468520808875 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
243468520808875 is a deficient number, since it is larger than the sum of its proper divisors (65361319628789).
243468520808875 is an equidigital number, since it uses as much as digits as its factorization.
243468520808875 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31930297887 (or 31930297877 counting only the distinct ones).
The product of its (nonzero) digits is 825753600, while the sum is 70.
The spelling of 243468520808875 in words is "two hundred forty-three trillion, four hundred sixty-eight billion, five hundred twenty million, eight hundred eight thousand, eight hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •