Base | Representation |
---|---|
bin | 1010001100100100101011… |
… | …1000100111111001001011 |
3 | 1110200202212022001200212010 |
4 | 2203021022320213321023 |
5 | 2432140333434000021 |
6 | 35502152355151003 |
7 | 2234656013111022 |
oct | 243111270477113 |
9 | 43622768050763 |
10 | 11211121000011 |
11 | 3632678593009 |
12 | 13109598a5463 |
13 | 6342867549ba |
14 | 2aa89a6238b9 |
15 | 14696111e976 |
hex | a324ae27e4b |
11211121000011 has 8 divisors (see below), whose sum is σ = 15827464941264. Its totient is φ = 7034428862720.
The previous prime is 11211120999959. The next prime is 11211121000039. The reversal of 11211121000011 is 11000012111211.
11211121000011 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 11211121000011 - 211 = 11211120997963 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11211121000111) 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, 109912950930 + ... + 109912951031.
It is an arithmetic number, because the mean of its divisors is an integer number (1978433117658).
Almost surely, 211211121000011 is an apocalyptic number.
11211121000011 is a deficient number, since it is larger than the sum of its proper divisors (4616343941253).
11211121000011 is a wasteful number, since it uses less digits than its factorization.
11211121000011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 219825901981.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11211121000011 its reverse (11000012111211), we get a palindrome (22211133111222).
The spelling of 11211121000011 in words is "eleven trillion, two hundred eleven billion, one hundred twenty-one million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •