Base | Representation |
---|---|
bin | 10100111110001011… |
… | …01010111000000000 |
3 | 1002001122210101002000 |
4 | 22133011222320000 |
5 | 141024300421042 |
6 | 5101115224000 |
7 | 546002622564 |
oct | 123705527000 |
9 | 32048711060 |
10 | 11258998272 |
11 | 4858458055 |
12 | 2222748000 |
13 | 10a579a972 |
14 | 78b44d6a4 |
15 | 45d69e74c |
hex | 29f16ae00 |
11258998272 has 320 divisors, whose sum is σ = 36839784960. Its totient is φ = 3377037312.
The previous prime is 11258998241. The next prime is 11258998277. The reversal of 11258998272 is 27289985211.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11258998277) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5404143 + ... + 5406225.
It is an arithmetic number, because the mean of its divisors is an integer number (115124328).
Almost surely, 211258998272 is an apocalyptic number.
11258998272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11258998272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18419892480).
11258998272 is an abundant number, since it is smaller than the sum of its proper divisors (25580786688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11258998272 is a wasteful number, since it uses less digits than its factorization.
11258998272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2150 (or 2128 counting only the distinct ones).
The product of its digits is 1451520, while the sum is 54.
The spelling of 11258998272 in words is "eleven billion, two hundred fifty-eight million, nine hundred ninety-eight thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •