Base | Representation |
---|---|
bin | 1010000000011010000001… |
… | …0100101001001001000100 |
3 | 1102221210100100002002121002 |
4 | 2200012200110221021010 |
5 | 2420224300324323022 |
6 | 35222143451312432 |
7 | 2213606214401006 |
oct | 240064024511104 |
9 | 42853310062532 |
10 | 11002101011012 |
11 | 3561a68218651 |
12 | 129834544b718 |
13 | 61a6557a7137 |
14 | 2a070c606376 |
15 | 1412cad71092 |
hex | a01a0529244 |
11002101011012 has 24 divisors (see below), whose sum is σ = 20292018462240. Its totient is φ = 5205095458560.
The previous prime is 11002101010997. The next prime is 11002101011029. The reversal of 11002101011012 is 21011010120011.
It is a super-2 number, since 2×110021010110122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11002101010984 and 11002101011002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 89188973 + ... + 89312244.
It is an arithmetic number, because the mean of its divisors is an integer number (845500769260).
Almost surely, 211002101011012 is an apocalyptic number.
It is an amenable number.
11002101011012 is a deficient number, since it is larger than the sum of its proper divisors (9289917451228).
11002101011012 is a wasteful number, since it uses less digits than its factorization.
11002101011012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178502051 (or 178502049 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11002101011012 its reverse (21011010120011), we get a palindrome (32013111131023).
The spelling of 11002101011012 in words is "eleven trillion, two billion, one hundred one million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •