Base | Representation |
---|---|
bin | 10000000001011111111… |
… | …011101110111011100100 |
3 | 10220021012000122200000112 |
4 | 100001133323232323210 |
5 | 121020044001401040 |
6 | 2201503103032152 |
7 | 142360544051603 |
oct | 20013773567344 |
9 | 3807160580015 |
10 | 1101121122020 |
11 | 394a8a192617 |
12 | 1594a329b658 |
13 | 7cab2142c9a |
14 | 3b41a343a3a |
15 | 1d99910a365 |
hex | 1005feeeee4 |
1101121122020 has 24 divisors (see below), whose sum is σ = 2312410560768. Its totient is φ = 440437743200.
The previous prime is 1101121121957. The next prime is 1101121122037. The reversal of 1101121122020 is 202211211011.
It is a junction number, because it is equal to n+sod(n) for n = 1101121121986 and 1101121122004.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 201965 + ... + 1497675.
It is an arithmetic number, because the mean of its divisors is an integer number (96350440032).
Almost surely, 21101121122020 is an apocalyptic number.
1101121122020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101121122020 is an abundant number, since it is smaller than the sum of its proper divisors (1211289438748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101121122020 is a wasteful number, since it uses less digits than its factorization.
1101121122020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1338211 (or 1338209 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1101121122020 its reverse (202211211011), we get a palindrome (1303332333031).
The spelling of 1101121122020 in words is "one trillion, one hundred one billion, one hundred twenty-one million, one hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •