Base | Representation |
---|---|
bin | 1001101100110110001000… |
… | …10000110001001101001001 |
3 | 2210112022212202020021120012 |
4 | 10312123010100301031021 |
5 | 10244001120140301441 |
6 | 113211455343041305 |
7 | 4331123221650251 |
oct | 466330420611511 |
9 | 83468782207505 |
10 | 21332100322121 |
11 | 6884990561366 |
12 | 24863792a0235 |
13 | bb97ba944904 |
14 | 53a69cb82961 |
15 | 26ed6beb29eb |
hex | 1366c4431349 |
21332100322121 has 8 divisors (see below), whose sum is σ = 22670276361984. Its totient is φ = 20003185016640.
The previous prime is 21332100322103. The next prime is 21332100322129. The reversal of 21332100322121 is 12122300123312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21332100322121 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21332100322129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2315178845 + ... + 2315188058.
It is an arithmetic number, because the mean of its divisors is an integer number (2833784545248).
Almost surely, 221332100322121 is an apocalyptic number.
It is an amenable number.
21332100322121 is a deficient number, since it is larger than the sum of its proper divisors (1338176039863).
21332100322121 is a wasteful number, since it uses less digits than its factorization.
21332100322121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4630367191.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 21332100322121 its reverse (12122300123312), we get a palindrome (33454400445433).
The spelling of 21332100322121 in words is "twenty-one trillion, three hundred thirty-two billion, one hundred million, three hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •