Base | Representation |
---|---|
bin | 1001101100110010010000… |
… | …11001110000001000011000 |
3 | 2210112010111221001221011121 |
4 | 10312121020121300020120 |
5 | 10243432341202132412 |
6 | 113210513231535024 |
7 | 4331020560040240 |
oct | 466311031601030 |
9 | 83463457057147 |
10 | 21330022302232 |
11 | 6884014576256 |
12 | 2485a9938a474 |
13 | bb9549281547 |
14 | 53a542bb8b20 |
15 | 26ec9983d107 |
hex | 136648670218 |
21330022302232 has 32 divisors (see below), whose sum is σ = 45709488381600. Its totient is φ = 9140978582784.
The previous prime is 21330022302223. The next prime is 21330022302257. The reversal of 21330022302232 is 23220322003312.
It is a junction number, because it is equal to n+sod(n) for n = 21330022302197 and 21330022302206.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8448807 + ... + 10679062.
It is an arithmetic number, because the mean of its divisors is an integer number (1428421511925).
Almost surely, 221330022302232 is an apocalyptic number.
It is an amenable number.
21330022302232 is an abundant number, since it is smaller than the sum of its proper divisors (24379466079368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21330022302232 is a wasteful number, since it uses less digits than its factorization.
21330022302232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19147795 (or 19147791 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 21330022302232 its reverse (23220322003312), we get a palindrome (44550344305544).
The spelling of 21330022302232 in words is "twenty-one trillion, three hundred thirty billion, twenty-two million, three hundred two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •