Base | Representation |
---|---|
bin | 1001101100110010101000… |
… | …10111101111100100011000 |
3 | 2210112011000220220121222122 |
4 | 10312121110113233210120 |
5 | 10243433244103232412 |
6 | 113210545203440412 |
7 | 4331025545566052 |
oct | 466312427574430 |
9 | 83464026817878 |
10 | 21330223102232 |
11 | 6884107955270 |
12 | 2485b34686108 |
13 | bb957ba58a05 |
14 | 53a5617288d2 |
15 | 26ecac2a4572 |
hex | 1366545ef918 |
21330223102232 has 32 divisors (see below), whose sum is σ = 43973545144320. Its totient is φ = 9619212990240.
The previous prime is 21330223102217. The next prime is 21330223102271. The reversal of 21330223102232 is 23220132203312.
It is a congruent number.
It is an unprimeable number.
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, 954275828 + ... + 954298179.
It is an arithmetic number, because the mean of its divisors is an integer number (1374173285760).
Almost surely, 221330223102232 is an apocalyptic number.
21330223102232 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21330223102232 is an abundant number, since it is smaller than the sum of its proper divisors (22643322042088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21330223102232 is a wasteful number, since it uses less digits than its factorization.
21330223102232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1908574151 (or 1908574147 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 21330223102232 its reverse (23220132203312), we get a palindrome (44550355305544).
The spelling of 21330223102232 in words is "twenty-one trillion, three hundred thirty billion, two hundred twenty-three million, one hundred two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •