Base | Representation |
---|---|
bin | 10100101000000010… |
… | …11011001011100000 |
3 | 1001120201102202100202 |
4 | 22110001123023200 |
5 | 140134233223112 |
6 | 5030444004332 |
7 | 541256542343 |
oct | 122401331340 |
9 | 31521382322 |
10 | 11073336032 |
11 | 4772678290 |
12 | 21905306a8 |
13 | 1076193755 |
14 | 77092045a |
15 | 44c2286c2 |
hex | 29405b2e0 |
11073336032 has 96 divisors (see below), whose sum is σ = 24083256960. Its totient is φ = 4970119680.
The previous prime is 11073336007. The next prime is 11073336037. The reversal of 11073336032 is 23063337011.
It is a junction number, because it is equal to n+sod(n) for n = 11073335986 and 11073336004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11073336037) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 11106158 + ... + 11107154.
It is an arithmetic number, because the mean of its divisors is an integer number (250867260).
Almost surely, 211073336032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11073336032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12041628480).
11073336032 is an abundant number, since it is smaller than the sum of its proper divisors (13009920928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11073336032 is a wasteful number, since it uses less digits than its factorization.
11073336032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1384 (or 1376 counting only the distinct ones).
The product of its (nonzero) digits is 6804, while the sum is 29.
The spelling of 11073336032 in words is "eleven billion, seventy-three million, three hundred thirty-six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •