Base | Representation |
---|---|
bin | 110111010100110111100111… |
… | …011101011100010010001101 |
3 | 1011220112210122200112212101012 |
4 | 313110313213131130102031 |
5 | 223343131002330201323 |
6 | 2221302421004055005 |
7 | 102152525414352245 |
oct | 6724674735342215 |
9 | 1156483580485335 |
10 | 243326665475213 |
11 | 70593294169611 |
12 | 2335a407b34465 |
13 | a5a07b579a528 |
14 | 441310577ab25 |
15 | 1d1e741bb5678 |
hex | dd4de775c48d |
243326665475213 has 8 divisors (see below), whose sum is σ = 243450541224000. Its totient is φ = 243202792120288.
The previous prime is 243326665475209. The next prime is 243326665475261. The reversal of 243326665475213 is 312574566623342.
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 243326665475213 - 22 = 243326665475209 is a prime.
It is a super-2 number, since 2×2433266654752132 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (243326665475263) 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, 224193233 + ... + 225275961.
It is an arithmetic number, because the mean of its divisors is an integer number (30431317653000).
Almost surely, 2243326665475213 is an apocalyptic number.
It is an amenable number.
243326665475213 is a deficient number, since it is larger than the sum of its proper divisors (123875748787).
243326665475213 is a wasteful number, since it uses less digits than its factorization.
243326665475213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1196931.
The product of its digits is 130636800, while the sum is 59.
The spelling of 243326665475213 in words is "two hundred forty-three trillion, three hundred twenty-six billion, six hundred sixty-five million, four hundred seventy-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •