Base | Representation |
---|---|
bin | 11101101110001010111… |
… | …01100010001101011000 |
3 | 10121121221120210100101210 |
4 | 32313011131202031120 |
5 | 113212424321244000 |
6 | 2101050402543120 |
7 | 133531533436356 |
oct | 16670535421530 |
9 | 3547846710353 |
10 | 1021220103000 |
11 | 3641081413a9 |
12 | 145b04667aa0 |
13 | 753ba685bc6 |
14 | 375da7b27d6 |
15 | 1b86e68e350 |
hex | edc5762358 |
1021220103000 has 128 divisors (see below), whose sum is σ = 3186823273920. Its totient is φ = 272272665600.
The previous prime is 1021220102993. The next prime is 1021220103011. The reversal of 1021220103000 is 3010221201.
It is a Harshad number since it is a multiple of its sum of digits (12).
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, 16928892 + ... + 16989108.
Almost surely, 21021220103000 is an apocalyptic number.
1021220103000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1021220103000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1593411636960).
1021220103000 is an abundant number, since it is smaller than the sum of its proper divisors (2165603170920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021220103000 is a wasteful number, since it uses less digits than its factorization.
1021220103000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65894 (or 65880 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 1021220103000 its reverse (3010221201), we get a palindrome (1024230324201).
The spelling of 1021220103000 in words is "one trillion, twenty-one billion, two hundred twenty million, one hundred three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •