Base | Representation |
---|---|
bin | 1001101100010010100111… |
… | …01001001010010111001110 |
3 | 2210110111122202222110120110 |
4 | 10312021103221022113032 |
5 | 10243143041420201110 |
6 | 113155023221500450 |
7 | 4326546530404206 |
oct | 466112351122716 |
9 | 83414582873513 |
10 | 21313031022030 |
11 | 6877895422a20 |
12 | 2482736b71726 |
13 | bb7a6c0220a7 |
14 | 5397b0329406 |
15 | 26e602cd9a20 |
hex | 136253a4a5ce |
21313031022030 has 128 divisors (see below), whose sum is σ = 56331082008576. Its totient is φ = 5117970355200.
The previous prime is 21313031022013. The next prime is 21313031022091. The reversal of 21313031022030 is 3022013031312.
It is a junction number, because it is equal to n+sod(n) for n = 21313031021988 and 21313031022006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 14782602 + ... + 16160178.
It is an arithmetic number, because the mean of its divisors is an integer number (440086578192).
Almost surely, 221313031022030 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21313031022030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28165541004288).
21313031022030 is an abundant number, since it is smaller than the sum of its proper divisors (35018050986546).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21313031022030 is a wasteful number, since it uses less digits than its factorization.
21313031022030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1378042.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 21313031022030 its reverse (3022013031312), we get a palindrome (24335044053342).
The spelling of 21313031022030 in words is "twenty-one trillion, three hundred thirteen billion, thirty-one million, twenty-two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •