Base | Representation |
---|---|
bin | 11001000010011110010001… |
… | …101001101010101000111101 |
3 | 112102220110211111121101100220 |
4 | 121002132101221222220331 |
5 | 103413211013142333041 |
6 | 1030112534542011553 |
7 | 32123662523540436 |
oct | 3102362151525075 |
9 | 472813744541326 |
10 | 110121110121021 |
11 | 320a71118a26aa |
12 | 10426260b76bb9 |
13 | 495a4b747116c |
14 | 1d29c6689c48d |
15 | cae781d9cd66 |
hex | 642791a6aa3d |
110121110121021 has 8 divisors (see below), whose sum is σ = 146828197454400. Its totient is φ = 73414048100832.
The previous prime is 110121110121017. The next prime is 110121110121023. The reversal of 110121110121021 is 120121011121011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110121110121021 - 22 = 110121110121017 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110121110121023) 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 7 ways as a sum of consecutive naturals, for example, 9423976 + ... + 17579918.
It is an arithmetic number, because the mean of its divisors is an integer number (18353524681800).
Almost surely, 2110121110121021 is an apocalyptic number.
It is an amenable number.
110121110121021 is a deficient number, since it is larger than the sum of its proper divisors (36707087333379).
110121110121021 is an equidigital number, since it uses as much as digits as its factorization.
110121110121021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12656595.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 110121110121021 its reverse (120121011121011), we get a palindrome (230242121242032).
The spelling of 110121110121021 in words is "one hundred ten trillion, one hundred twenty-one billion, one hundred ten million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •