Base | Representation |
---|---|
bin | 1001101100010000110001… |
… | …10100000011011000111111 |
3 | 2210110102002222202122010021 |
4 | 10312020120310003120333 |
5 | 10243134031232140221 |
6 | 113154341242553011 |
7 | 4326513214134121 |
oct | 466103064033077 |
9 | 83412088678107 |
10 | 21312044021311 |
11 | 687742927874a |
12 | 2482500508767 |
13 | bb79426b69b4 |
14 | 539719203211 |
15 | 26e596325041 |
hex | 136218d0363f |
21312044021311 has 8 divisors (see below), whose sum is σ = 21371587754400. Its totient is φ = 21252501281760.
The previous prime is 21312044021293. The next prime is 21312044021363. The reversal of 21312044021311 is 11312044021312.
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 21312044021311 - 241 = 19113020765759 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 (21312044021111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71964201 + ... + 72259741.
It is an arithmetic number, because the mean of its divisors is an integer number (2671448469300).
Almost surely, 221312044021311 is an apocalyptic number.
21312044021311 is a deficient number, since it is larger than the sum of its proper divisors (59543733089).
21312044021311 is a wasteful number, since it uses less digits than its factorization.
21312044021311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 496769.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 21312044021311 its reverse (11312044021312), we get a palindrome (32624088042623).
Subtracting from 21312044021311 its reverse (11312044021312), we obtain a palindrome (9999999999999).
The spelling of 21312044021311 in words is "twenty-one trillion, three hundred twelve billion, forty-four million, twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •