Base | Representation |
---|---|
bin | 1010000000011010001000… |
… | …1110101101111000101101 |
3 | 1102221210102120021220201100 |
4 | 2200012202032231320231 |
5 | 2420224332022341023 |
6 | 35222150553233313 |
7 | 2213610053402253 |
oct | 240064216557055 |
9 | 42853376256640 |
10 | 11002133012013 |
11 | 3561a84295460 |
12 | 1298354102839 |
13 | 61a65c2ccb40 |
14 | 2a07129765d3 |
15 | 1412cda92c43 |
hex | a01a23ade2d |
11002133012013 has 48 divisors (see below), whose sum is σ = 19022555994624. Its totient is φ = 6038906590080.
The previous prime is 11002133011997. The next prime is 11002133012053. The reversal of 11002133012013 is 31021033120011.
11002133012013 is a `hidden beast` number, since 110 + 0 + 21 + 330 + 1 + 201 + 3 = 666.
It is not a de Polignac number, because 11002133012013 - 24 = 11002133011997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11002133012053) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 80579581 + ... + 80716002.
It is an arithmetic number, because the mean of its divisors is an integer number (396303249888).
Almost surely, 211002133012013 is an apocalyptic number.
11002133012013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11002133012013 is a deficient number, since it is larger than the sum of its proper divisors (8020422982611).
11002133012013 is a wasteful number, since it uses less digits than its factorization.
11002133012013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 161295666 (or 161295663 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 11002133012013 its reverse (31021033120011), we get a palindrome (42023166132024).
The spelling of 11002133012013 in words is "eleven trillion, two billion, one hundred thirty-three million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •