Base | Representation |
---|---|
bin | 1001101011111100100101… |
… | …00101110111110000110100 |
3 | 2210102101010102000011121112 |
4 | 10311332102211313300310 |
5 | 10242444330232102012 |
6 | 113145345345334152 |
7 | 4325650435305140 |
oct | 465762245676064 |
9 | 83371112004545 |
10 | 21301202222132 |
11 | 6872875373538 |
12 | 2480395637358 |
13 | bb690549cc01 |
14 | 538dab354220 |
15 | 26e15e5d5122 |
hex | 135f92977c34 |
21301202222132 has 48 divisors (see below), whose sum is σ = 45798777507840. Its totient is φ = 8464595465952.
The previous prime is 21301202222087. The next prime is 21301202222147. The reversal of 21301202222132 is 23122220210312.
It is a happy number.
It is a super-2 number, since 2×213012022221322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21301202222098 and 21301202222107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 425930888 + ... + 425980895.
It is an arithmetic number, because the mean of its divisors is an integer number (954141198080).
Almost surely, 221301202222132 is an apocalyptic number.
It is an amenable number.
21301202222132 is an abundant number, since it is smaller than the sum of its proper divisors (24497575285708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21301202222132 is a wasteful number, since it uses less digits than its factorization.
21301202222132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 851911860 (or 851911858 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 21301202222132 its reverse (23122220210312), we get a palindrome (44423422432444).
The spelling of 21301202222132 in words is "twenty-one trillion, three hundred one billion, two hundred two million, two hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •