Base | Representation |
---|---|
bin | 10100011111010101… |
… | …11001010000001001 |
3 | 1001101122001012121112 |
4 | 22033222321100021 |
5 | 140012040233113 |
6 | 5015315020105 |
7 | 536412120542 |
oct | 121752712011 |
9 | 31348035545 |
10 | 11000321033 |
11 | 4735438009 |
12 | 216bb9a635 |
13 | 106400a800 |
14 | 764d554c9 |
15 | 445b045a8 |
hex | 28fab9409 |
11000321033 has 12 divisors (see below), whose sum is σ = 12202124508. Its totient is φ = 9906474240.
The previous prime is 11000320979. The next prime is 11000321039. The reversal of 11000321033 is 33012300011.
It can be written as a sum of positive squares in 6 ways, for example, as 2711493184 + 8288827849 = 52072^2 + 91043^2 .
It is not a de Polignac number, because 11000321033 - 28 = 11000320777 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11000320999 and 11000321017.
It is not an unprimeable number, because it can be changed into a prime (11000321039) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 786860 + ... + 800717.
It is an arithmetic number, because the mean of its divisors is an integer number (1016843709).
Almost surely, 211000321033 is an apocalyptic number.
11000321033 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11000321033 is a deficient number, since it is larger than the sum of its proper divisors (1201803475).
11000321033 is a wasteful number, since it uses less digits than its factorization.
11000321033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1587644 (or 1587631 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 11000321033 its reverse (33012300011), we get a palindrome (44012621044).
The spelling of 11000321033 in words is "eleven billion, three hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •