Base | Representation |
---|---|
bin | 10100101011010111… |
… | …00000000110001000 |
3 | 1001122122202111221110 |
4 | 22111223200012020 |
5 | 140213343042212 |
6 | 5033320010320 |
7 | 542045106441 |
oct | 122553400610 |
9 | 31578674843 |
10 | 11101143432 |
11 | 4787340405 |
12 | 21999009a0 |
13 | 107bb7b732 |
14 | 7744bc2c8 |
15 | 44e8bca3c |
hex | 295ae0188 |
11101143432 has 32 divisors (see below), whose sum is σ = 27768530880. Its totient is φ = 3698291520.
The previous prime is 11101143401. The next prime is 11101143451. The reversal of 11101143432 is 23434110111.
It is a junction number, because it is equal to n+sod(n) for n = 11101143399 and 11101143408.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 86919 + ... + 172502.
It is an arithmetic number, because the mean of its divisors is an integer number (867766590).
Almost surely, 211101143432 is an apocalyptic number.
11101143432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11101143432 is an abundant number, since it is smaller than the sum of its proper divisors (16667387448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11101143432 is a wasteful number, since it uses less digits than its factorization.
11101143432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261213 (or 261209 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 11101143432 its reverse (23434110111), we get a palindrome (34535253543).
The spelling of 11101143432 in words is "eleven billion, one hundred one million, one hundred forty-three thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •