Base | Representation |
---|---|
bin | 11101101101111101110… |
… | …10011010001111010100 |
3 | 10121121122221001022202020 |
4 | 32312332322122033110 |
5 | 113212213204411040 |
6 | 2101031440013140 |
7 | 133526030522664 |
oct | 16667672321724 |
9 | 3547587038666 |
10 | 1021110232020 |
11 | 36406111873a |
12 | 145a939011b0 |
13 | 753a09974a8 |
14 | 375c9d721a4 |
15 | 1b864bd9cd0 |
hex | edbee9a3d4 |
1021110232020 has 48 divisors (see below), whose sum is σ = 2885339022720. Its totient is φ = 269797931136.
The previous prime is 1021110232007. The next prime is 1021110232049. The reversal of 1021110232020 is 202320111201.
It is a super-2 number, since 2×10211102320202 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 78059992 + ... + 78073071.
It is an arithmetic number, because the mean of its divisors is an integer number (60111229640).
Almost surely, 21021110232020 is an apocalyptic number.
1021110232020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1021110232020 is an abundant number, since it is smaller than the sum of its proper divisors (1864228790700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021110232020 is a wasteful number, since it uses less digits than its factorization.
1021110232020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156133184 (or 156133182 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1021110232020 its reverse (202320111201), we get a palindrome (1223430343221).
The spelling of 1021110232020 in words is "one trillion, twenty-one billion, one hundred ten million, two hundred thirty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •