Base | Representation |
---|---|
bin | 11001000010010101110011… |
… | …111001100000000101011100 |
3 | 112102212121101001212021010112 |
4 | 121002111303321200011130 |
5 | 103413033404340133040 |
6 | 1030104433015025152 |
7 | 32123221346502554 |
oct | 3102256371400534 |
9 | 472777331767115 |
10 | 110112021021020 |
11 | 320a3278285307 |
12 | 1042454506b1b8 |
13 | 49596993c5795 |
14 | 1d296436d2164 |
15 | cae3ede71365 |
hex | 642573e6015c |
110112021021020 has 24 divisors (see below), whose sum is σ = 231255811657584. Its totient is φ = 44040890786816.
The previous prime is 110112021020959. The next prime is 110112021021043. The reversal of 110112021021020 is 20120120211011.
It is a junction number, because it is equal to n+sod(n) for n = 110112021020986 and 110112021021004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 244620869 + ... + 245070588.
It is an arithmetic number, because the mean of its divisors is an integer number (9635658819066).
Almost surely, 2110112021021020 is an apocalyptic number.
110112021021020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110112021021020 is an abundant number, since it is smaller than the sum of its proper divisors (121143790636564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110112021021020 is a wasteful number, since it uses less digits than its factorization.
110112021021020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 489702709 (or 489702707 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110112021021020 its reverse (20120120211011), we get a palindrome (130232141232031).
The spelling of 110112021021020 in words is "one hundred ten trillion, one hundred twelve billion, twenty-one million, twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •