Base | Representation |
---|---|
bin | 1001100011100100001000… |
… | …10101110011101010111011 |
3 | 2202101211202001121201122101 |
4 | 10301302010111303222323 |
5 | 10223240013240234321 |
6 | 112405155253204231 |
7 | 4266103456451260 |
oct | 461620425635273 |
9 | 82354661551571 |
10 | 21013200321211 |
11 | 677171484a6aa |
12 | 24345ba330677 |
13 | b956c82bb817 |
14 | 529089897267 |
15 | 26690541d791 |
hex | 131c84573abb |
21013200321211 has 8 divisors (see below), whose sum is σ = 24033460296960. Its totient is φ = 17997533899368.
The previous prime is 21013200321209. The next prime is 21013200321299. The reversal of 21013200321211 is 11212300231012.
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 21013200321211 - 21 = 21013200321209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21013200321611) 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, 1148378671 + ... + 1148396968.
It is an arithmetic number, because the mean of its divisors is an integer number (3004182537120).
Almost surely, 221013200321211 is an apocalyptic number.
21013200321211 is a deficient number, since it is larger than the sum of its proper divisors (3020259975749).
21013200321211 is a wasteful number, since it uses less digits than its factorization.
21013200321211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2296776953.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 21013200321211 its reverse (11212300231012), we get a palindrome (32225500552223).
The spelling of 21013200321211 in words is "twenty-one trillion, thirteen billion, two hundred million, three hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •