Base | Representation |
---|---|
bin | 10100100001110110… |
… | …10111011111110000 |
3 | 1001110002201222001121 |
4 | 22100323113133300 |
5 | 140032440311212 |
6 | 5021351112024 |
7 | 540056331265 |
oct | 122073273760 |
9 | 31402658047 |
10 | 11021416432 |
11 | 4746336324 |
12 | 2177072614 |
13 | 10684b56b0 |
14 | 767a8726c |
15 | 4478bed07 |
hex | 290ed77f0 |
11021416432 has 40 divisors (see below), whose sum is σ = 23002972160. Its totient is φ = 5085400320.
The previous prime is 11021416423. The next prime is 11021416433. The reversal of 11021416432 is 23461412011.
It is a super-2 number, since 2×110214164322 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11021416397 and 11021416406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021416433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1341457 + ... + 1349647.
It is an arithmetic number, because the mean of its divisors is an integer number (575074304).
Almost surely, 211021416432 is an apocalyptic number.
It is an amenable number.
11021416432 is an abundant number, since it is smaller than the sum of its proper divisors (11981555728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11021416432 is a wasteful number, since it uses less digits than its factorization.
11021416432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14681 (or 14675 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 11021416432 its reverse (23461412011), we get a palindrome (34482828443).
The spelling of 11021416432 in words is "eleven billion, twenty-one million, four hundred sixteen thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •