Base | Representation |
---|---|
bin | 110011010001110101… |
… | …1010110000001101110 |
3 | 101112020110122100022220 |
4 | 1212203223112001232 |
5 | 3301011234343042 |
6 | 122331042420210 |
7 | 10645611343134 |
oct | 1464353260156 |
9 | 345213570286 |
10 | 110120231022 |
11 | 42779aaa49a |
12 | 19413061666 |
13 | a4cc3a5019 |
14 | 548915d754 |
15 | 2ce79468ec |
hex | 19a3ad606e |
110120231022 has 16 divisors (see below), whose sum is σ = 220377532032. Its totient is φ = 36683898680.
The previous prime is 110120231021. The next prime is 110120231051. The reversal of 110120231022 is 220132021011.
110120231022 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 110120230992 and 110120231010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110120231021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5700804 + ... + 5720087.
It is an arithmetic number, because the mean of its divisors is an integer number (13773595752).
Almost surely, 2110120231022 is an apocalyptic number.
110120231022 is an abundant number, since it is smaller than the sum of its proper divisors (110257301010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110120231022 is a wasteful number, since it uses less digits than its factorization.
110120231022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11422503.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 110120231022 its reverse (220132021011), we get a palindrome (330252252033).
The spelling of 110120231022 in words is "one hundred ten billion, one hundred twenty million, two hundred thirty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •