Base | Representation |
---|---|
bin | 1001101100100001100000… |
… | …00000100001110101110100 |
3 | 2210111021021202111012200022 |
4 | 10312100300000201311310 |
5 | 10243310423403233244 |
6 | 113202424235504312 |
7 | 4330251554100641 |
oct | 466206000416564 |
9 | 83437252435608 |
10 | 21321023102324 |
11 | 6880216781160 |
12 | 24841a75b8098 |
13 | bb8743a2149a |
14 | 539d2b930dc8 |
15 | 26e91e76d6ee |
hex | 136430021d74 |
21321023102324 has 12 divisors (see below), whose sum is σ = 40703771377248. Its totient is φ = 9691374137400.
The previous prime is 21321023102261. The next prime is 21321023102363. The reversal of 21321023102324 is 42320132012312.
It is a super-2 number, since 2×213210231023242 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21321023102293 and 21321023102302.
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 3 ways as a sum of consecutive naturals, for example, 242284353392 + ... + 242284353479.
It is an arithmetic number, because the mean of its divisors is an integer number (3391980948104).
Almost surely, 221321023102324 is an apocalyptic number.
It is an amenable number.
21321023102324 is a deficient number, since it is larger than the sum of its proper divisors (19382748274924).
21321023102324 is a wasteful number, since it uses less digits than its factorization.
21321023102324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 484568706886 (or 484568706884 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 21321023102324 its reverse (42320132012312), we get a palindrome (63641155114636).
The spelling of 21321023102324 in words is "twenty-one trillion, three hundred twenty-one billion, twenty-three million, one hundred two thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •