Base | Representation |
---|---|
bin | 10100110001100000… |
… | …00001011011111111 |
3 | 1001210020200211200202 |
4 | 22120300001123333 |
5 | 140320040111343 |
6 | 5042400114115 |
7 | 543242022245 |
oct | 123060013377 |
9 | 31706624622 |
10 | 11152660223 |
11 | 4803427771 |
12 | 21b300593b |
13 | 1089748343 |
14 | 77b28c795 |
15 | 454196db8 |
hex | 298c016ff |
11152660223 has 32 divisors (see below), whose sum is σ = 12508231680. Its totient is φ = 9899712000.
The previous prime is 11152660153. The next prime is 11152660231. The reversal of 11152660223 is 32206625111.
11152660223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11152660223 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11152660273) 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 in 31 ways as a sum of consecutive naturals, for example, 3306728 + ... + 3310098.
It is an arithmetic number, because the mean of its divisors is an integer number (390882240).
Almost surely, 211152660223 is an apocalyptic number.
11152660223 is a deficient number, since it is larger than the sum of its proper divisors (1355571457).
11152660223 is a wasteful number, since it uses less digits than its factorization.
11152660223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3599.
The product of its (nonzero) digits is 4320, while the sum is 29.
The spelling of 11152660223 in words is "eleven billion, one hundred fifty-two million, six hundred sixty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •