Base | Representation |
---|---|
bin | 10100101101001100… |
… | …10100100000000000 |
3 | 1001200201202212211112 |
4 | 22112212110200000 |
5 | 140231314444212 |
6 | 5035030302452 |
7 | 542323136003 |
oct | 122646244000 |
9 | 31621685745 |
10 | 11116562432 |
11 | 4795011988 |
12 | 21a2ab7a28 |
13 | 10821199c1 |
14 | 77657353a |
15 | 450e16422 |
hex | 296994800 |
11116562432 has 48 divisors (see below), whose sum is σ = 22351247100. Its totient is φ = 5527388160.
The previous prime is 11116562393. The next prime is 11116562437. The reversal of 11116562432 is 23426561111.
It can be written as a sum of positive squares in 2 ways, for example, as 10902701056 + 213861376 = 104416^2 + 14624^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is not an unprimeable number, because it can be changed into a prime (11116562437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 355694 + ... + 385682.
Almost surely, 211116562432 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 11116562432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11175623550).
11116562432 is an abundant number, since it is smaller than the sum of its proper divisors (11234684668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11116562432 is an equidigital number, since it uses as much as digits as its factorization.
11116562432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30192 (or 30172 counting only the distinct ones).
The product of its digits is 8640, while the sum is 32.
The spelling of 11116562432 in words is "eleven billion, one hundred sixteen million, five hundred sixty-two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •