Base | Representation |
---|---|
bin | 1010010000110101110000… |
… | …0101000100100101111111 |
3 | 1110221210001220102212011122 |
4 | 2210031130011010211333 |
5 | 2434341000010414444 |
6 | 35555554235141155 |
7 | 2243162354464016 |
oct | 244153405044577 |
9 | 43853056385148 |
10 | 11284423919999 |
11 | 366077413381a |
12 | 1322bb68a47bb |
13 | 63b169264779 |
14 | 2b0251b75a7d |
15 | 1488016ad4ee |
hex | a435c14497f |
11284423919999 has 8 divisors (see below), whose sum is σ = 12045641546880. Its totient is φ = 10539936351000.
The previous prime is 11284423919971. The next prime is 11284423920013. The reversal of 11284423919999 is 99991932448211.
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 11284423919999 - 236 = 11215704443263 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (71).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11284423919929) 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, 4182513077 + ... + 4182515774.
It is an arithmetic number, because the mean of its divisors is an integer number (1505705193360).
Almost surely, 211284423919999 is an apocalyptic number.
11284423919999 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
11284423919999 is a deficient number, since it is larger than the sum of its proper divisors (761217626881).
11284423919999 is an equidigital number, since it uses as much as digits as its factorization.
11284423919999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8365028941.
The product of its digits is 90699264, while the sum is 71.
The spelling of 11284423919999 in words is "eleven trillion, two hundred eighty-four billion, four hundred twenty-three million, nine hundred nineteen thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •