Base | Representation |
---|---|
bin | 1001101100110110001010… |
… | …11100101011010101001001 |
3 | 2210112022221010200020200202 |
4 | 10312123011130223111021 |
5 | 10244001140234033001 |
6 | 113211501333341545 |
7 | 4331123553045422 |
oct | 466330534532511 |
9 | 83468833606622 |
10 | 21332120221001 |
11 | 68849a0812717 |
12 | 2486383a978b5 |
13 | bb97c1ac0cb5 |
14 | 53a6a1682649 |
15 | 26ed6dae396b |
hex | 1366c572b549 |
21332120221001 has 8 divisors (see below), whose sum is σ = 21405829820544. Its totient is φ = 21258522729360.
The previous prime is 21332120220991. The next prime is 21332120221003. The reversal of 21332120221001 is 10012202123312.
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 21332120221001 - 218 = 21332119958857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21332120221003) 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, 27645746 + ... + 28406891.
It is an arithmetic number, because the mean of its divisors is an integer number (2675728727568).
Almost surely, 221332120221001 is an apocalyptic number.
It is an amenable number.
21332120221001 is a deficient number, since it is larger than the sum of its proper divisors (73709599543).
21332120221001 is an equidigital number, since it uses as much as digits as its factorization.
21332120221001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56053951.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 21332120221001 its reverse (10012202123312), we get a palindrome (31344322344313).
The spelling of 21332120221001 in words is "twenty-one trillion, three hundred thirty-two billion, one hundred twenty million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •