Base | Representation |
---|---|
bin | 11101101111101001011… |
… | …10101101000111110110 |
3 | 10121200222212000110110110 |
4 | 32313310232231013312 |
5 | 113221040330231202 |
6 | 2101301212203450 |
7 | 133560303204150 |
oct | 16676456550766 |
9 | 3550885013413 |
10 | 1022013133302 |
11 | 364484851847 |
12 | 1460a6169586 |
13 | 754b5a685c5 |
14 | 37673c45ad0 |
15 | 1b8b90db26c |
hex | edf4bad1f6 |
1022013133302 has 128 divisors (see below), whose sum is σ = 2498102830080. Its totient is φ = 272091156480.
The previous prime is 1022013133289. The next prime is 1022013133303. The reversal of 1022013133302 is 2033313102201.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022013133303) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 115255873 + ... + 115264739.
It is an arithmetic number, because the mean of its divisors is an integer number (19516428360).
Almost surely, 21022013133302 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1022013133302, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1249051415040).
1022013133302 is an abundant number, since it is smaller than the sum of its proper divisors (1476089696778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022013133302 is a wasteful number, since it uses less digits than its factorization.
1022013133302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10486.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1022013133302 its reverse (2033313102201), we get a palindrome (3055326235503).
The spelling of 1022013133302 in words is "one trillion, twenty-two billion, thirteen million, one hundred thirty-three thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •