Base | Representation |
---|---|
bin | 11101101110011001100… |
… | …11100100100000111000 |
3 | 10121122021011122102111211 |
4 | 32313030303210200320 |
5 | 113213202342220440 |
6 | 2101110523532504 |
7 | 133534560660064 |
oct | 16671463444070 |
9 | 3548234572454 |
10 | 1021343320120 |
11 | 364170750232 |
12 | 145b3998a134 |
13 | 7540a068246 |
14 | 3760ccc8aa4 |
15 | 1b87a3cceea |
hex | edccce4838 |
1021343320120 has 16 divisors (see below), whose sum is σ = 2298022470360. Its totient is φ = 408537328032.
The previous prime is 1021343320111. The next prime is 1021343320139. The reversal of 1021343320120 is 210233431201.
1021343320120 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 1021343320091 and 1021343320100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12766791462 + ... + 12766791541.
Almost surely, 21021343320120 is an apocalyptic number.
1021343320120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1021343320120 is an abundant number, since it is smaller than the sum of its proper divisors (1276679150240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021343320120 is a wasteful number, since it uses less digits than its factorization.
1021343320120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25533583014 (or 25533583010 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 1021343320120 its reverse (210233431201), we get a palindrome (1231576751321).
The spelling of 1021343320120 in words is "one trillion, twenty-one billion, three hundred forty-three million, three hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •