Base | Representation |
---|---|
bin | 10000000001100101110… |
… | …101000000011101101001 |
3 | 10220021102220202022110020 |
4 | 100001211311000131221 |
5 | 121020244311201441 |
6 | 2201520554511053 |
7 | 142363154513232 |
oct | 20014565003551 |
9 | 3807386668406 |
10 | 1101220022121 |
11 | 39502aaa273a |
12 | 159510435489 |
13 | 7cac978cc5b |
14 | 3b42952a089 |
15 | 1d9a2b43e66 |
hex | 10065d40769 |
1101220022121 has 4 divisors (see below), whose sum is σ = 1468293362832. Its totient is φ = 734146681412.
The previous prime is 1101220022093. The next prime is 1101220022167. The reversal of 1101220022121 is 1212200221011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1101220022121 - 26 = 1101220022057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1101220022121.
It is not an unprimeable number, because it can be changed into a prime (1101220092121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 183536670351 + ... + 183536670356.
It is an arithmetic number, because the mean of its divisors is an integer number (367073340708).
Almost surely, 21101220022121 is an apocalyptic number.
It is an amenable number.
1101220022121 is a deficient number, since it is larger than the sum of its proper divisors (367073340711).
1101220022121 is an equidigital number, since it uses as much as digits as its factorization.
1101220022121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 367073340710.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1101220022121 its reverse (1212200221011), we get a palindrome (2313420243132).
The spelling of 1101220022121 in words is "one trillion, one hundred one billion, two hundred twenty million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •