Base | Representation |
---|---|
bin | 10000000010100000001… |
… | …111101101100011111000 |
3 | 10220100222012221111002010 |
4 | 100002200033231203320 |
5 | 121024301211213422 |
6 | 2202202125205520 |
7 | 142426355164335 |
oct | 20024017554370 |
9 | 3810865844063 |
10 | 1102200101112 |
11 | 39549324a580 |
12 | 1597447008a0 |
13 | 7cc24843956 |
14 | 3b4bd76d98c |
15 | 1da0dbdcb0c |
hex | 100a03ed8f8 |
1102200101112 has 64 divisors (see below), whose sum is σ = 3006093974400. Its totient is φ = 333989619840.
The previous prime is 1102200101053. The next prime is 1102200101147. The reversal of 1102200101112 is 2111010022011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15116439 + ... + 15189177.
It is an arithmetic number, because the mean of its divisors is an integer number (46970218350).
Almost surely, 21102200101112 is an apocalyptic number.
1102200101112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1102200101112 is an abundant number, since it is smaller than the sum of its proper divisors (1903893873288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102200101112 is a wasteful number, since it uses less digits than its factorization.
1102200101112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130156 (or 130152 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1102200101112 its reverse (2111010022011), we get a palindrome (3213210123123).
The spelling of 1102200101112 in words is "one trillion, one hundred two billion, two hundred million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •