Base | Representation |
---|---|
bin | 10100101101101110… |
… | …10101000001010011 |
3 | 1001201001011101212002 |
4 | 22112313111001103 |
5 | 140233440133021 |
6 | 5035310024215 |
7 | 542406055532 |
oct | 122667250123 |
9 | 31631141762 |
10 | 11121021011 |
11 | 4797587761 |
12 | 21a44a806b |
13 | 108301b209 |
14 | 776db4319 |
15 | 4514e750b |
hex | 296dd5053 |
11121021011 has 8 divisors (see below), whose sum is σ = 11187126720. Its totient is φ = 11054959848.
The previous prime is 11121020987. The next prime is 11121021061. The reversal of 11121021011 is 11012012111.
11121021011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11121021011 - 226 = 11053912147 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11121020983 and 11121021001.
It is not an unprimeable number, because it can be changed into a prime (11121021061) 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, 582560 + ... + 601346.
It is an arithmetic number, because the mean of its divisors is an integer number (1398390840).
Almost surely, 211121021011 is an apocalyptic number.
11121021011 is a deficient number, since it is larger than the sum of its proper divisors (66105709).
11121021011 is a wasteful number, since it uses less digits than its factorization.
11121021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22273.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11121021011 its reverse (11012012111), we get a palindrome (22133033122).
The spelling of 11121021011 in words is "eleven billion, one hundred twenty-one million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •