Base | Representation |
---|---|
bin | 1010000000011010001000… |
… | …0100011111010111010101 |
3 | 1102221210102101020201012000 |
4 | 2200012202010133113111 |
5 | 2420224330331043333 |
6 | 35222150415545513 |
7 | 2213610021535206 |
oct | 240064204372725 |
9 | 42853371221160 |
10 | 11002130331093 |
11 | 3561a82824220 |
12 | 129835322b299 |
13 | 61a65b8a17b5 |
14 | 2a07124795ad |
15 | 1412cd713713 |
hex | a01a211f5d5 |
11002130331093 has 64 divisors (see below), whose sum is σ = 18248182517760. Its totient is φ = 6494969707200.
The previous prime is 11002130330981. The next prime is 11002130331097. The reversal of 11002130331093 is 39013303120011.
11002130331093 is a `hidden beast` number, since 110 + 0 + 2 + 130 + 331 + 0 + 93 = 666.
It is not a de Polignac number, because 11002130331093 - 210 = 11002130330069 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11002130331097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1081921 + ... + 4814022.
It is an arithmetic number, because the mean of its divisors is an integer number (285127851840).
Almost surely, 211002130331093 is an apocalyptic number.
It is an amenable number.
11002130331093 is a deficient number, since it is larger than the sum of its proper divisors (7246052186667).
11002130331093 is a wasteful number, since it uses less digits than its factorization.
11002130331093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5896127 (or 5896121 counting only the distinct ones).
The product of its (nonzero) digits is 1458, while the sum is 27.
The spelling of 11002130331093 in words is "eleven trillion, two billion, one hundred thirty million, three hundred thirty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •