Base | Representation |
---|---|
bin | 1010000000111110111110… |
… | …1010101010111010110000 |
3 | 1102222201221202101122202021 |
4 | 2200033233222222322300 |
5 | 2420410110130320422 |
6 | 35230504135201224 |
7 | 2214410113416226 |
oct | 240175752527260 |
9 | 42881852348667 |
10 | 11012022120112 |
11 | 3566199449772 |
12 | 129a253b16214 |
13 | 61b577031cb0 |
14 | 2a0db00b0b16 |
15 | 1416abd48dc7 |
hex | a03efaaaeb0 |
11012022120112 has 20 divisors (see below), whose sum is σ = 22977007693360. Its totient is φ = 5082471747648.
The previous prime is 11012022120089. The next prime is 11012022120119. The reversal of 11012022120112 is 21102122021011.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is not an unprimeable number, because it can be changed into a prime (11012022120119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26471206812 + ... + 26471207227.
It is an arithmetic number, because the mean of its divisors is an integer number (1148850384668).
Almost surely, 211012022120112 is an apocalyptic number.
It is an amenable number.
11012022120112 is an abundant number, since it is smaller than the sum of its proper divisors (11964985573248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11012022120112 is a wasteful number, since it uses less digits than its factorization.
11012022120112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52942414060 (or 52942414054 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11012022120112 its reverse (21102122021011), we get a palindrome (32114144141123).
The spelling of 11012022120112 in words is "eleven trillion, twelve billion, twenty-two million, one hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •