Base | Representation |
---|---|
bin | 1010001101010001101011… |
… | …0111100111100011110011 |
3 | 1110201221001010110100021002 |
4 | 2203110122313213203303 |
5 | 2432340103241111034 |
6 | 35511511141152215 |
7 | 2235564236536304 |
oct | 243243267474363 |
9 | 43657033410232 |
10 | 11223200332019 |
11 | 3637806aa9a25 |
12 | 131316b0bb66b |
13 | 635460174830 |
14 | 2ab2c49b27ab |
15 | 146e1b810e7e |
hex | a351ade78f3 |
11223200332019 has 8 divisors (see below), whose sum is σ = 12291379764720. Its totient is φ = 10184286089376.
The previous prime is 11223200331979. The next prime is 11223200332037. The reversal of 11223200332019 is 91023300232211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11223200332019 - 212 = 11223200327923 is a prime.
It is a super-3 number, since 3×112232003320193 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11223200331982 and 11223200332000.
It is not an unprimeable number, because it can be changed into a prime (11223200332919) 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, 7316296712 + ... + 7316298245.
It is an arithmetic number, because the mean of its divisors is an integer number (1536422470590).
Almost surely, 211223200332019 is an apocalyptic number.
11223200332019 is a deficient number, since it is larger than the sum of its proper divisors (1068179432701).
11223200332019 is a wasteful number, since it uses less digits than its factorization.
11223200332019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14632595029.
The product of its (nonzero) digits is 3888, while the sum is 29.
The spelling of 11223200332019 in words is "eleven trillion, two hundred twenty-three billion, two hundred million, three hundred thirty-two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •