Base | Representation |
---|---|
bin | 1010000000010010010100… |
… | …0001001011011011111000 |
3 | 1102221121000011110020201022 |
4 | 2200010211001023123320 |
5 | 2420211031232423112 |
6 | 35221202312042012 |
7 | 2213504024625512 |
oct | 240044501133370 |
9 | 42847004406638 |
10 | 11000032311032 |
11 | 35610a6518746 |
12 | 1297a68693308 |
13 | 61a3b6027bcb |
14 | 2a0593986bb2 |
15 | 14120943cd72 |
hex | a012504b6f8 |
11000032311032 has 8 divisors (see below), whose sum is σ = 20625060583200. Its totient is φ = 5500016155512.
The previous prime is 11000032311031. The next prime is 11000032311091. The reversal of 11000032311032 is 23011323000011.
It is a tau number, because it is divible by the number of its divisors (8).
It is a self number, because there is not a number n which added to its sum of digits gives 11000032311032.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000032311031) 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 as a sum of consecutive naturals, namely, 687502019432 + ... + 687502019447.
It is an arithmetic number, because the mean of its divisors is an integer number (2578132572900).
Almost surely, 211000032311032 is an apocalyptic number.
It is an amenable number.
11000032311032 is a deficient number, since it is larger than the sum of its proper divisors (9625028272168).
11000032311032 is a wasteful number, since it uses less digits than its factorization.
11000032311032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1375004038885 (or 1375004038881 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 11000032311032 its reverse (23011323000011), we get a palindrome (34011355311043).
The spelling of 11000032311032 in words is "eleven trillion, thirty-two million, three hundred eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •