Base | Representation |
---|---|
bin | 1010000000111011001011… |
… | …0000011001101010011001 |
3 | 1102222122022112111100112011 |
4 | 2200032302300121222121 |
5 | 2420401012023241441 |
6 | 35230214512145521 |
7 | 2214342564351520 |
oct | 240166260315231 |
9 | 42878275440464 |
10 | 11011000212121 |
11 | 3565814622108 |
12 | 129a0098382a1 |
13 | 61b4433c4100 |
14 | 2a0d1449d4b7 |
15 | 14164c28b581 |
hex | a03b2c19a99 |
11011000212121 has 24 divisors (see below), whose sum is σ = 13657502221440. Its totient is φ = 8692154654976.
The previous prime is 11011000212083. The next prime is 11011000212151. The reversal of 11011000212121 is 12121200011011.
It is a happy number.
It is not a de Polignac number, because 11011000212121 - 211 = 11011000210073 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (11011000212151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10081680 + ... + 11120353.
It is an arithmetic number, because the mean of its divisors is an integer number (569062592560).
Almost surely, 211011000212121 is an apocalyptic number.
It is an amenable number.
11011000212121 is a deficient number, since it is larger than the sum of its proper divisors (2646502009319).
11011000212121 is a wasteful number, since it uses less digits than its factorization.
11011000212121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21202505 (or 21202492 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11011000212121 its reverse (12121200011011), we get a palindrome (23132200223132).
The spelling of 11011000212121 in words is "eleven trillion, eleven billion, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •