Base | Representation |
---|---|
bin | 1010000001100001111101… |
… | …0110010000100010000000 |
3 | 1110000122012011010111021222 |
4 | 2200120133112100202000 |
5 | 2421033322433310422 |
6 | 35235100005134212 |
7 | 2215161602233640 |
oct | 240303726204200 |
9 | 43018164114258 |
10 | 11021412010112 |
11 | 356a177830039 |
12 | 12a00346ba368 |
13 | 61c4124c3c1a |
14 | 2a16211b8520 |
15 | 141a5b38d842 |
hex | a061f590880 |
11021412010112 has 256 divisors, whose sum is σ = 26978462484480. Its totient is φ = 4377342197760.
The previous prime is 11021412010093. The next prime is 11021412010123. The reversal of 11021412010112 is 21101021412011.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 894371183 + ... + 894383505.
It is an arithmetic number, because the mean of its divisors is an integer number (105384619080).
Almost surely, 211021412010112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11021412010112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13489231242240).
11021412010112 is an abundant number, since it is smaller than the sum of its proper divisors (15957050474368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11021412010112 is a wasteful number, since it uses less digits than its factorization.
11021412010112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13259 (or 13247 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11021412010112 its reverse (21101021412011), we get a palindrome (32122433422123).
The spelling of 11021412010112 in words is "eleven trillion, twenty-one billion, four hundred twelve million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •