Base | Representation |
---|---|
bin | 1010000001100000011110… |
… | …0000101110010000011001 |
3 | 1110000121011021121221220211 |
4 | 2200120013200232100121 |
5 | 2421032013044200441 |
6 | 35234552201451121 |
7 | 2215145645115412 |
oct | 240300740562031 |
9 | 43017137557824 |
10 | 11021012100121 |
11 | 3569a92016811 |
12 | 129bb427a0aa1 |
13 | 61c37a6b45aa |
14 | 2a15c4038809 |
15 | 141a361e6a81 |
hex | a060782e419 |
11021012100121 has 8 divisors (see below), whose sum is σ = 11023010267904. Its totient is φ = 11019014120400.
The previous prime is 11021012100107. The next prime is 11021012100173. The reversal of 11021012100121 is 12100121012011.
It is a happy number.
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 11021012100121 - 235 = 10986652361753 is a prime.
It is a super-2 number, since 2×110210121001212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11021012100181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 165788536 + ... + 165854998.
It is an arithmetic number, because the mean of its divisors is an integer number (1377876283488).
Almost surely, 211021012100121 is an apocalyptic number.
It is an amenable number.
11021012100121 is a deficient number, since it is larger than the sum of its proper divisors (1998167783).
11021012100121 is an equidigital number, since it uses as much as digits as its factorization.
11021012100121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94031.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11021012100121 its reverse (12100121012011), we get a palindrome (23121133112132).
The spelling of 11021012100121 in words is "eleven trillion, twenty-one billion, twelve million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •