Base | Representation |
---|---|
bin | 1001101101001010101001… |
… | …00100110001110011010101 |
3 | 2210120101022010120001210102 |
4 | 10312211110210301303111 |
5 | 10244141143010434031 |
6 | 113220520125103445 |
7 | 4331663124520616 |
oct | 466452444616325 |
9 | 83511263501712 |
10 | 21343111421141 |
11 | 6889620a8aaa4 |
12 | 24885309b7b85 |
13 | bba853c57113 |
14 | 53b025301c0d |
15 | 2702b39e57cb |
hex | 136954931cd5 |
21343111421141 has 4 divisors (see below), whose sum is σ = 21343940016000. Its totient is φ = 21342282826284.
The previous prime is 21343111421131. The next prime is 21343111421147. The reversal of 21343111421141 is 14112411134312.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 21343111421141 - 230 = 21342037679317 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 (21343111421147) 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, 414258791 + ... + 414310308.
It is an arithmetic number, because the mean of its divisors is an integer number (5335985004000).
Almost surely, 221343111421141 is an apocalyptic number.
It is an amenable number.
21343111421141 is a deficient number, since it is larger than the sum of its proper divisors (828594859).
21343111421141 is an equidigital number, since it uses as much as digits as its factorization.
21343111421141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 828594858.
The product of its digits is 2304, while the sum is 29.
Adding to 21343111421141 its reverse (14112411134312), we get a palindrome (35455522555453).
The spelling of 21343111421141 in words is "twenty-one trillion, three hundred forty-three billion, one hundred eleven million, four hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •