Base | Representation |
---|---|
bin | 10100111001100000… |
… | …01001010110000000 |
3 | 1001221221000222011200 |
4 | 22130300021112000 |
5 | 140434232121342 |
6 | 5053155141200 |
7 | 545015511315 |
oct | 123460112600 |
9 | 31857028150 |
10 | 11219801472 |
11 | 4838315a00 |
12 | 22115a4800 |
13 | 109a6258a9 |
14 | 786168d0c |
15 | 45a00a94c |
hex | 29cc09580 |
11219801472 has 144 divisors (see below), whose sum is σ = 35488520340. Its totient is φ = 3399897600.
The previous prime is 11219801447. The next prime is 11219801477. The reversal of 11219801472 is 27410891211.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11219801477) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 99147 + ... + 179637.
Almost surely, 211219801472 is an apocalyptic number.
11219801472 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 11219801472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17744260170).
11219801472 is an abundant number, since it is smaller than the sum of its proper divisors (24268718868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11219801472 is a wasteful number, since it uses less digits than its factorization.
11219801472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80533 (or 80507 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 36.
The spelling of 11219801472 in words is "eleven billion, two hundred nineteen million, eight hundred one thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •