Base | Representation |
---|---|
bin | 1010000001000011000100… |
… | …1110011000110001110000 |
3 | 1102222211210102000110002200 |
4 | 2200100301032120301300 |
5 | 2420414333213031112 |
6 | 35231205225343200 |
7 | 2214446300311113 |
oct | 240206116306160 |
9 | 42884712013080 |
10 | 11013122002032 |
11 | 3566703293297 |
12 | 129a500337b00 |
13 | 61b6c0b70cb7 |
14 | 2a10761bc57a |
15 | 1417236a9cdc |
hex | a0431398c70 |
11013122002032 has 60 divisors (see below), whose sum is σ = 30823056049344. Its totient is φ = 3670848852480.
The previous prime is 11013122002013. The next prime is 11013122002081. The reversal of 11013122002032 is 23020022131011.
11013122002032 is a `hidden beast` number, since 1 + 101 + 312 + 200 + 20 + 32 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 11013122001996 and 11013122002014.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 780808 + ... + 4757720.
Almost surely, 211013122002032 is an apocalyptic number.
11013122002032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11013122002032 is an abundant number, since it is smaller than the sum of its proper divisors (19809934047312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11013122002032 is a wasteful number, since it uses less digits than its factorization.
11013122002032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3996158 (or 3996149 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 11013122002032 its reverse (23020022131011), we get a palindrome (34033144133043).
The spelling of 11013122002032 in words is "eleven trillion, thirteen billion, one hundred twenty-two million, two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •