Base | Representation |
---|---|
bin | 10100111000011101… |
… | …01001111111110000 |
3 | 1001221022111221102220 |
4 | 22130032221333300 |
5 | 140430010203240 |
6 | 5052243041040 |
7 | 544551055161 |
oct | 123416517760 |
9 | 31838457386 |
10 | 11211022320 |
11 | 483336a003 |
12 | 220a670180 |
13 | 1098870924 |
14 | 784d21768 |
15 | 4593745d0 |
hex | 29c3a9ff0 |
11211022320 has 80 divisors (see below), whose sum is σ = 34766515872. Its totient is φ = 2988544000.
The previous prime is 11211022309. The next prime is 11211022337. The reversal of 11211022320 is 2322011211.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 11211022320.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 855820 + ... + 868820.
Almost surely, 211211022320 is an apocalyptic number.
11211022320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11211022320 is an abundant number, since it is smaller than the sum of its proper divisors (23555493552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11211022320 is a wasteful number, since it uses less digits than its factorization.
11211022320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16610 (or 16604 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 11211022320 its reverse (2322011211), we get a palindrome (13533033531).
The spelling of 11211022320 in words is "eleven billion, two hundred eleven million, twenty-two thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •