Base | Representation |
---|---|
bin | 10100110111100101… |
… | …00111011000000000 |
3 | 1001220210200111002020 |
4 | 22123302213120000 |
5 | 140421114442202 |
6 | 5051421321440 |
7 | 544431431313 |
oct | 123362473000 |
9 | 31823614066 |
10 | 11203671552 |
11 | 482a1a9297 |
12 | 2208106280 |
13 | 1097198b68 |
14 | 783d6a97a |
15 | 4588c15bc |
hex | 29bca7600 |
11203671552 has 80 divisors (see below), whose sum is σ = 29869717680. Its totient is φ = 3731750912.
The previous prime is 11203671547. The next prime is 11203671571. The reversal of 11203671552 is 25517630211.
It is a hoax number, since the sum of its digits (33) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3489724 + ... + 3492932.
It is an arithmetic number, because the mean of its divisors is an integer number (373371471).
Almost surely, 211203671552 is an apocalyptic number.
11203671552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11203671552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14934858840).
11203671552 is an abundant number, since it is smaller than the sum of its proper divisors (18666046128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11203671552 is an equidigital number, since it uses as much as digits as its factorization.
11203671552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5503 (or 5487 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 33.
The spelling of 11203671552 in words is "eleven billion, two hundred three million, six hundred seventy-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •