Base | Representation |
---|---|
bin | 1001101001010100111101… |
… | …01100111111001110110111 |
3 | 2210002202211202211120011021 |
4 | 10310222132230333032313 |
5 | 10240011030020213421 |
6 | 113040143523322011 |
7 | 4316313404351623 |
oct | 464523654771667 |
9 | 83082752746137 |
10 | 21211211101111 |
11 | 6838695767349 |
12 | 2466a5b820307 |
13 | bab293469185 |
14 | 5348b16c8183 |
15 | 26bb43e0e341 |
hex | 134a9eb3f3b7 |
21211211101111 has 4 divisors (see below), whose sum is σ = 21299224425424. Its totient is φ = 21123197776800.
The previous prime is 21211211101081. The next prime is 21211211101181. The reversal of 21211211101111 is 11110111211212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21211211101111 - 27 = 21211211100983 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21211211101181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44006661795 + ... + 44006662276.
It is an arithmetic number, because the mean of its divisors is an integer number (5324806106356).
Almost surely, 221211211101111 is an apocalyptic number.
21211211101111 is a deficient number, since it is larger than the sum of its proper divisors (88013324313).
21211211101111 is an equidigital number, since it uses as much as digits as its factorization.
21211211101111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88013324312.
The product of its (nonzero) digits is 8, while the sum is 16.
Adding to 21211211101111 its reverse (11110111211212), we get a palindrome (32321322312323).
It can be divided in two parts, 21211211101 and 111, that added together give a palindrome (21211211212).
The spelling of 21211211101111 in words is "twenty-one trillion, two hundred eleven billion, two hundred eleven million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •