Base | Representation |
---|---|
bin | 1001100011100010011101… |
… | …10011110100110000010111 |
3 | 2202101202102110200110211002 |
4 | 10301301032303310300113 |
5 | 10223231143332022221 |
6 | 112404530211533515 |
7 | 4266042302642303 |
oct | 461611663646027 |
9 | 82352373613732 |
10 | 21012302220311 |
11 | 67712a38a5156 |
12 | 24343a95ba29b |
13 | b955b420b67c |
14 | 5290024b2d03 |
15 | 2668a166980b |
hex | 131c4ecf4c17 |
21012302220311 has 4 divisors (see below), whose sum is σ = 21020604199224. Its totient is φ = 21004000241400.
The previous prime is 21012302220307. The next prime is 21012302220379. The reversal of 21012302220311 is 11302220321012.
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 21012302220311 - 22 = 21012302220307 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 (21012302220391) 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 3 ways as a sum of consecutive naturals, for example, 4150985660 + ... + 4150990721.
It is an arithmetic number, because the mean of its divisors is an integer number (5255151049806).
Almost surely, 221012302220311 is an apocalyptic number.
21012302220311 is a deficient number, since it is larger than the sum of its proper divisors (8301978913).
21012302220311 is an equidigital number, since it uses as much as digits as its factorization.
21012302220311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8301978912.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 21012302220311 its reverse (11302220321012), we get a palindrome (32314522541323).
The spelling of 21012302220311 in words is "twenty-one trillion, twelve billion, three hundred two million, two hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •