Base | Representation |
---|---|
bin | 1010010001010110000111… |
… | …0001000100110000011001 |
3 | 1110222121111012110122022102 |
4 | 2210111201301010300121 |
5 | 2440011241433310143 |
6 | 40003552140333145 |
7 | 2243620530003461 |
oct | 244254161046031 |
9 | 43877435418272 |
10 | 11293109275673 |
11 | 3664420859015 |
12 | 132481b5441b5 |
13 | 63bc2178a494 |
14 | 2b0837484ba1 |
15 | 148b5de370b8 |
hex | a4561c44c19 |
11293109275673 has 8 divisors (see below), whose sum is σ = 11542335805440. Its totient is φ = 11044255563040.
The previous prime is 11293109275667. The next prime is 11293109275703. The reversal of 11293109275673 is 37657290139211.
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 11293109275673 - 220 = 11293108227097 is a prime.
It is a super-2 number, since 2×112931092756732 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11293109275603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 93143033 + ... + 93264198.
It is an arithmetic number, because the mean of its divisors is an integer number (1442791975680).
Almost surely, 211293109275673 is an apocalyptic number.
It is an amenable number.
11293109275673 is a deficient number, since it is larger than the sum of its proper divisors (249226529767).
11293109275673 is a wasteful number, since it uses less digits than its factorization.
11293109275673 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186408567.
The product of its (nonzero) digits is 4286520, while the sum is 56.
The spelling of 11293109275673 in words is "eleven trillion, two hundred ninety-three billion, one hundred nine million, two hundred seventy-five thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •