Base | Representation |
---|---|
bin | 10100100101010100… |
… | …00011100000000000 |
3 | 1001112010100010122020 |
4 | 22102222003200000 |
5 | 140112402320022 |
6 | 5024305041440 |
7 | 540561061260 |
oct | 122252034000 |
9 | 31463303566 |
10 | 11050432512 |
11 | 4760754559 |
12 | 2184926280 |
13 | 1071504882 |
14 | 76b87b7a0 |
15 | 44a20235c |
hex | 292a83800 |
11050432512 has 96 divisors (see below), whose sum is σ = 33669417600. Its totient is φ = 3157254144.
The previous prime is 11050432493. The next prime is 11050432579. The reversal of 11050432512 is 21523405011.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×110504325122 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
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, 85462 + ... + 171477.
It is an arithmetic number, because the mean of its divisors is an integer number (350723100).
Almost surely, 211050432512 is an apocalyptic number.
11050432512 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11050432512 is an abundant number, since it is smaller than the sum of its proper divisors (22618985088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11050432512 is an equidigital number, since it uses as much as digits as its factorization.
11050432512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 256971 (or 256951 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
Adding to 11050432512 its reverse (21523405011), we get a palindrome (32573837523).
The spelling of 11050432512 in words is "eleven billion, fifty million, four hundred thirty-two thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •