Base | Representation |
---|---|
bin | 10000010101000011100… |
… | …100100011101100001101 |
3 | 10222021101110222100101020 |
4 | 100111003210203230031 |
5 | 121341100222333401 |
6 | 2215254520304353 |
7 | 144033116440350 |
oct | 20250344435415 |
9 | 3867343870336 |
10 | 1122120121101 |
11 | 3a2985611411 |
12 | 1615839120b9 |
13 | 81a7a797325 |
14 | 3c44d196297 |
15 | 1e2c790ad36 |
hex | 10543923b0d |
1122120121101 has 8 divisors (see below), whose sum is σ = 1709897327424. Its totient is φ = 641211497760.
The previous prime is 1122120121097. The next prime is 1122120121123. The reversal of 1122120121101 is 1011210212211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1122120121101 - 22 = 1122120121097 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122120121301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26717145720 + ... + 26717145761.
It is an arithmetic number, because the mean of its divisors is an integer number (213737165928).
Almost surely, 21122120121101 is an apocalyptic number.
It is an amenable number.
1122120121101 is a deficient number, since it is larger than the sum of its proper divisors (587777206323).
1122120121101 is an equidigital number, since it uses as much as digits as its factorization.
1122120121101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53434291491.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1122120121101 its reverse (1011210212211), we get a palindrome (2133330333312).
The spelling of 1122120121101 in words is "one trillion, one hundred twenty-two billion, one hundred twenty million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •