Base | Representation |
---|---|
bin | 1001101100100001011110… |
… | …11010110110001111010001 |
3 | 2210111021021001220100201022 |
4 | 10312100233122312033101 |
5 | 10243310413341140101 |
6 | 113202423244045225 |
7 | 4330251404120222 |
oct | 466205732661721 |
9 | 83437231810638 |
10 | 21321013224401 |
11 | 6880211144790 |
12 | 24841a4233815 |
13 | bb8741973367 |
14 | 539d2a4bd249 |
15 | 26e91d96ba1b |
hex | 13642f6b63d1 |
21321013224401 has 4 divisors (see below), whose sum is σ = 23259287153904. Its totient is φ = 19382739294900.
The previous prime is 21321013224391. The next prime is 21321013224409. The reversal of 21321013224401 is 10442231012312.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 21321013224401 - 218 = 21321012962257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21321013224409) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 969136964735 + ... + 969136964756.
It is an arithmetic number, because the mean of its divisors is an integer number (5814821788476).
Almost surely, 221321013224401 is an apocalyptic number.
It is an amenable number.
21321013224401 is a deficient number, since it is larger than the sum of its proper divisors (1938273929503).
21321013224401 is a wasteful number, since it uses less digits than its factorization.
21321013224401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1938273929502.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 21321013224401 its reverse (10442231012312), we get a palindrome (31763244236713).
The spelling of 21321013224401 in words is "twenty-one trillion, three hundred twenty-one billion, thirteen million, two hundred twenty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •