Base | Representation |
---|---|
bin | 10100100011010000… |
… | …10100110111010100 |
3 | 1001110220220202000000 |
4 | 22101220110313110 |
5 | 140043444432012 |
6 | 5022451451300 |
7 | 540261446031 |
oct | 122150246724 |
9 | 31426822000 |
10 | 11033202132 |
11 | 4751a56077 |
12 | 217abb6b30 |
13 | 106aa80c94 |
14 | 769474388 |
15 | 44894bddc |
hex | 291a14dd4 |
11033202132 has 42 divisors (see below), whose sum is σ = 28948920378. Its totient is φ = 3677733072.
The previous prime is 11033202121. The next prime is 11033202137. The reversal of 11033202132 is 23120233011.
It can be written as a sum of positive squares in only one way, i.e., 10099044036 + 934158096 = 100494^2 + 30564^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11033202137) by changing a digit.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 1888923 + ... + 1894754.
It is an arithmetic number, because the mean of its divisors is an integer number (689260009).
Almost surely, 211033202132 is an apocalyptic number.
11033202132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11033202132 is an abundant number, since it is smaller than the sum of its proper divisors (17915718246).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11033202132 is an equidigital number, since it uses as much as digits as its factorization.
11033202132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3783699 (or 3783682 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 11033202132 its reverse (23120233011), we get a palindrome (34153435143).
The spelling of 11033202132 in words is "eleven billion, thirty-three million, two hundred two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •