Base | Representation |
---|---|
bin | 1001100011110011000110… |
… | …00000111010100111100111 |
3 | 2202102121110202000010210002 |
4 | 10301321203000322213213 |
5 | 10223402440132143421 |
6 | 112413004213251515 |
7 | 4266506463302231 |
oct | 461714300724747 |
9 | 82377422003702 |
10 | 21021231131111 |
11 | 6775065a50a82 |
12 | 243607b933b9b |
13 | b963a802b443 |
14 | 52960c2a1251 |
15 | 266c254a2b0b |
hex | 131e6303a9e7 |
21021231131111 has 8 divisors (see below), whose sum is σ = 21088559727360. Its totient is φ = 20953903606272.
The previous prime is 21021231131083. The next prime is 21021231131119. The reversal of 21021231131111 is 11113113212012.
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 21021231131111 - 210 = 21021231130087 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 (21021231131119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62623226 + ... + 62958008.
It is an arithmetic number, because the mean of its divisors is an integer number (2636069965920).
Almost surely, 221021231131111 is an apocalyptic number.
21021231131111 is a deficient number, since it is larger than the sum of its proper divisors (67328596249).
21021231131111 is a wasteful number, since it uses less digits than its factorization.
21021231131111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 535705.
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 21021231131111 its reverse (11113113212012), we get a palindrome (32134344343123).
The spelling of 21021231131111 in words is "twenty-one trillion, twenty-one billion, two hundred thirty-one million, one hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •