Base | Representation |
---|---|
bin | 11101101100000111110… |
… | …01110010001010010000 |
3 | 10121112002221011002202020 |
4 | 32312003321302022100 |
5 | 113203201233241422 |
6 | 2100345312251440 |
7 | 133462346506401 |
oct | 16660371621220 |
9 | 3545087132666 |
10 | 1020120212112 |
11 | 3636a32a1071 |
12 | 145858240b80 |
13 | 75273842ab1 |
14 | 375346a19a8 |
15 | 1b807d2a95c |
hex | ed83e72290 |
1020120212112 has 20 divisors (see below), whose sum is σ = 2635310548080. Its totient is φ = 340040070688.
The previous prime is 1020120212039. The next prime is 1020120212141. The reversal of 1020120212112 is 2112120210201.
It is a junction number, because it is equal to n+sod(n) for n = 1020120212091 and 1020120212100.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10626252162 + ... + 10626252257.
It is an arithmetic number, because the mean of its divisors is an integer number (131765527404).
Almost surely, 21020120212112 is an apocalyptic number.
1020120212112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1020120212112 is an abundant number, since it is smaller than the sum of its proper divisors (1615190335968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020120212112 is a wasteful number, since it uses less digits than its factorization.
1020120212112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21252504430 (or 21252504424 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1020120212112 its reverse (2112120210201), we get a palindrome (3132240422313).
The spelling of 1020120212112 in words is "one trillion, twenty billion, one hundred twenty million, two hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •