Base | Representation |
---|---|
bin | 1001101100110100001000… |
… | …11110111101100111000001 |
3 | 2210112020010011210120200210 |
4 | 10312122010132331213001 |
5 | 10243441422224113441 |
6 | 113211201240504333 |
7 | 4331054546634432 |
oct | 466320436754701 |
9 | 83466104716623 |
10 | 21331030301121 |
11 | 6884491562792 |
12 | 248611aa7b0a9 |
13 | bb967a05c4a8 |
14 | 53a5daa09489 |
15 | 26ed0809e616 |
hex | 1366847bd9c1 |
21331030301121 has 8 divisors (see below), whose sum is σ = 28441399164544. Its totient is φ = 14220674152560.
The previous prime is 21331030301093. The next prime is 21331030301129. The reversal of 21331030301121 is 12110303013312.
It is a happy number.
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-21331030301121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21331030301129) 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, 1890795 + ... + 6799791.
It is an arithmetic number, because the mean of its divisors is an integer number (3555174895568).
Almost surely, 221331030301121 is an apocalyptic number.
It is an amenable number.
21331030301121 is a deficient number, since it is larger than the sum of its proper divisors (7110368863423).
21331030301121 is a wasteful number, since it uses less digits than its factorization.
21331030301121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6357431.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 21331030301121 its reverse (12110303013312), we get a palindrome (33441333314433).
The spelling of 21331030301121 in words is "twenty-one trillion, three hundred thirty-one billion, thirty million, three hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •