Base | Representation |
---|---|
bin | 10101010001101001… |
… | …11111111000000000 |
3 | 1002111001021001002212 |
4 | 22220310333320000 |
5 | 141343113300000 |
6 | 5125233401252 |
7 | 553025540504 |
oct | 125064777000 |
9 | 32431231085 |
10 | 11422400000 |
11 | 4931713200 |
12 | 2269409228 |
13 | 11005ac88b |
14 | 7a5026304 |
15 | 46cbc9c35 |
hex | 2a8d3fe00 |
11422400000 has 360 divisors, whose sum is σ = 31886787240. Its totient is φ = 4083200000.
The previous prime is 11422399979. The next prime is 11422400021. The reversal of 11422400000 is 422411.
It is an interprime number because it is at equal distance from previous prime (11422399979) and next prime (11422400021).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 193599971 + ... + 193600029.
It is an arithmetic number, because the mean of its divisors is an integer number (88574409).
Almost surely, 211422400000 is an apocalyptic number.
11422400000 is a gapful number since it is divisible by the number (10) 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 11422400000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15943393620).
11422400000 is an abundant number, since it is smaller than the sum of its proper divisors (20464387240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11422400000 is an frugal number, since it uses more digits than its factorization.
11422400000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124 (or 77 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 11422400000 its reverse (422411), we get a palindrome (11422822411).
The spelling of 11422400000 in words is "eleven billion, four hundred twenty-two million, four hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •