Base | Representation |
---|---|
bin | 11101101101111110000… |
… | …01100010100010011100 |
3 | 10121121200001120021112110 |
4 | 32312333001202202130 |
5 | 113212214144213040 |
6 | 2101031544034020 |
7 | 133526052435654 |
oct | 16667701424234 |
9 | 3547601507473 |
10 | 1021112101020 |
11 | 364062184970 |
12 | 145a94462910 |
13 | 753a11a00cb |
14 | 375ca2db364 |
15 | 1b864e58980 |
hex | edbf06289c |
1021112101020 has 96 divisors (see below), whose sum is σ = 3119240275200. Its totient is φ = 247525903360.
The previous prime is 1021112100941. The next prime is 1021112101039. The reversal of 1021112101020 is 201012111201.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 1021112100987 and 1021112101005.
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, 12070831 + ... + 12155129.
It is an arithmetic number, because the mean of its divisors is an integer number (32492086200).
Almost surely, 21021112101020 is an apocalyptic number.
1021112101020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1021112101020 is an abundant number, since it is smaller than the sum of its proper divisors (2098128174180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021112101020 is a wasteful number, since it uses less digits than its factorization.
1021112101020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102675 (or 102673 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1021112101020 its reverse (201012111201), we get a palindrome (1222124212221).
The spelling of 1021112101020 in words is "one trillion, twenty-one billion, one hundred twelve million, one hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •