Base | Representation |
---|---|
bin | 1001101001011110010000… |
… | …01011110001100010110100 |
3 | 2210010020201121002201201212 |
4 | 10310233020023301202310 |
5 | 10240101240203122120 |
6 | 113042331051540552 |
7 | 4316551156342055 |
oct | 464571013614264 |
9 | 83106647081655 |
10 | 21216202004660 |
11 | 683a816a21023 |
12 | 2467a1315a758 |
13 | bab8aa461540 |
14 | 534c2649c72c |
15 | 26bd3716a6c5 |
hex | 134bc82f18b4 |
21216202004660 has 96 divisors (see below), whose sum is σ = 51231757167360. Its totient is φ = 7318822275072.
The previous prime is 21216202004639. The next prime is 21216202004681. The reversal of 21216202004660 is 6640020261212.
It is an interprime number because it is at equal distance from previous prime (21216202004639) and next prime (21216202004681).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40997045 + ... + 41511324.
It is an arithmetic number, because the mean of its divisors is an integer number (533664137160).
Almost surely, 221216202004660 is an apocalyptic number.
21216202004660 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21216202004660 is an abundant number, since it is smaller than the sum of its proper divisors (30015555162700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21216202004660 is a wasteful number, since it uses less digits than its factorization.
21216202004660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82508457 (or 82508455 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 32.
Adding to 21216202004660 its reverse (6640020261212), we get a palindrome (27856222265872).
The spelling of 21216202004660 in words is "twenty-one trillion, two hundred sixteen billion, two hundred two million, four thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •