Base | Representation |
---|---|
bin | 10000000001011111111… |
… | …011101001110011011110 |
3 | 10220021012000121121012211 |
4 | 100001133323221303132 |
5 | 121020044000213042 |
6 | 2201503102351034 |
7 | 142360543633435 |
oct | 20013773516336 |
9 | 3807160547184 |
10 | 1101121101022 |
11 | 394a8a178868 |
12 | 1594a328b47a |
13 | 7cab2136567 |
14 | 3b41a33a11c |
15 | 1d999104017 |
hex | 1005fee9cde |
1101121101022 has 16 divisors (see below), whose sum is σ = 1662686762400. Its totient is φ = 546892473600.
The previous prime is 1101121101013. The next prime is 1101121101029. The reversal of 1101121101022 is 2201011211011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1101121100993 and 1101121101011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101121101029) 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, 9536854 + ... + 9651622.
It is an arithmetic number, because the mean of its divisors is an integer number (103917922650).
Almost surely, 21101121101022 is an apocalyptic number.
1101121101022 is a deficient number, since it is larger than the sum of its proper divisors (561565661378).
1101121101022 is a wasteful number, since it uses less digits than its factorization.
1101121101022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146691.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1101121101022 its reverse (2201011211011), we get a palindrome (3302132312033).
The spelling of 1101121101022 in words is "one trillion, one hundred one billion, one hundred twenty-one million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •