Base | Representation |
---|---|
bin | 1001101100010000101101… |
… | …10110111100000000111111 |
3 | 2210110102000201001022102211 |
4 | 10312020112312330000333 |
5 | 10243133444333114403 |
6 | 113154334112001251 |
7 | 4326512335302406 |
oct | 466102666740077 |
9 | 83412021038384 |
10 | 21312011223103 |
11 | 6877411806997 |
12 | 24824b1530227 |
13 | bb7938972183 |
14 | 539714b0663d |
15 | 26e5934e706d |
hex | 136216dbc03f |
21312011223103 has 8 divisors (see below), whose sum is σ = 22025018294496. Its totient is φ = 20608204243200.
The previous prime is 21312011223043. The next prime is 21312011223109. The reversal of 21312011223103 is 30132211021312.
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 21312011223103 - 233 = 21303421288511 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 (21312011223109) 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, 2300018163 + ... + 2300027428.
It is an arithmetic number, because the mean of its divisors is an integer number (2753127286812).
Almost surely, 221312011223103 is an apocalyptic number.
21312011223103 is a deficient number, since it is larger than the sum of its proper divisors (713007071393).
21312011223103 is a wasteful number, since it uses less digits than its factorization.
21312011223103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4600045745.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 21312011223103 its reverse (30132211021312), we get a palindrome (51444222244415).
The spelling of 21312011223103 in words is "twenty-one trillion, three hundred twelve billion, eleven million, two hundred twenty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •