Base | Representation |
---|---|
bin | 11101101111110011110… |
… | …10111000100110010000 |
3 | 10121201012220212112010120 |
4 | 32313321322320212100 |
5 | 113221230123241422 |
6 | 2101314002430240 |
7 | 133562411312220 |
oct | 16677172704620 |
9 | 3551186775116 |
10 | 1022100212112 |
11 | 364519a18401 |
12 | 14610b362380 |
13 | 754cab06a25 |
14 | 37681632080 |
15 | 1b8c1a8c45c |
hex | edf9eb8990 |
1022100212112 has 40 divisors (see below), whose sum is σ = 3017629198656. Its totient is φ = 292028631936.
The previous prime is 1022100212059. The next prime is 1022100212123. The reversal of 1022100212112 is 2112120012201.
It is a super-3 number, since 3×10221002121123 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1022100212091 and 1022100212100.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1520982123 + ... + 1520982794.
Almost surely, 21022100212112 is an apocalyptic number.
1022100212112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1022100212112 is an abundant number, since it is smaller than the sum of its proper divisors (1995528986544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022100212112 is a wasteful number, since it uses less digits than its factorization.
1022100212112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3041964935 (or 3041964929 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1022100212112 its reverse (2112120012201), we get a palindrome (3134220224313).
The spelling of 1022100212112 in words is "one trillion, twenty-two billion, one hundred million, two hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •