Base | Representation |
---|---|
bin | 1001101100110010011101… |
… | …11000100100011010100001 |
3 | 2210112010210111200120211112 |
4 | 10312121032320210122201 |
5 | 10243433102021402001 |
6 | 113210532114353105 |
7 | 4331023350241523 |
oct | 466311670443241 |
9 | 83463714616745 |
10 | 21330131044001 |
11 | 688406a99858a |
12 | 2485b0988b795 |
13 | bb9565965ca0 |
14 | 53a553403a13 |
15 | 26eca416ccbb |
hex | 13664ee246a1 |
21330131044001 has 8 divisors (see below), whose sum is σ = 23404323758760. Its totient is φ = 19317854529792.
The previous prime is 21330131043929. The next prime is 21330131044049. The reversal of 21330131044001 is 10044013103312.
It can be written as a sum of positive squares in 4 ways, for example, as 13432810000 + 21316698234001 = 115900^2 + 4617001^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-21330131044001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21330131044051) 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, 15479049416 + ... + 15479050793.
It is an arithmetic number, because the mean of its divisors is an integer number (2925540469845).
Almost surely, 221330131044001 is an apocalyptic number.
It is an amenable number.
21330131044001 is a deficient number, since it is larger than the sum of its proper divisors (2074192714759).
21330131044001 is a wasteful number, since it uses less digits than its factorization.
21330131044001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30958100275.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 21330131044001 its reverse (10044013103312), we get a palindrome (31374144147313).
The spelling of 21330131044001 in words is "twenty-one trillion, three hundred thirty billion, one hundred thirty-one million, forty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •