Base | Representation |
---|---|
bin | 11101101110010111000… |
… | …10010100110011110100 |
3 | 10121122012200120101011110 |
4 | 32313023202110303310 |
5 | 113213131414202012 |
6 | 2101104443235020 |
7 | 133534211643606 |
oct | 16671342246364 |
9 | 3548180511143 |
10 | 1021322022132 |
11 | 36415a723795 |
12 | 145b32818a70 |
13 | 7540581c099 |
14 | 3760a143176 |
15 | 1b8785c273c |
hex | edcb894cf4 |
1021322022132 has 96 divisors (see below), whose sum is σ = 2465027712000. Its totient is φ = 328973052672.
The previous prime is 1021322022131. The next prime is 1021322022139. The reversal of 1021322022132 is 2312202231201.
It is a junction number, because it is equal to n+sod(n) for n = 1021322022099 and 1021322022108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021322022131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11650368 + ... + 11737704.
It is an arithmetic number, because the mean of its divisors is an integer number (25677372000).
Almost surely, 21021322022132 is an apocalyptic number.
1021322022132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1021322022132 is an abundant number, since it is smaller than the sum of its proper divisors (1443705689868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021322022132 is a wasteful number, since it uses less digits than its factorization.
1021322022132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87685 (or 87683 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 1021322022132 its reverse (2312202231201), we get a palindrome (3333524253333).
The spelling of 1021322022132 in words is "one trillion, twenty-one billion, three hundred twenty-two million, twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •