Base | Representation |
---|---|
bin | 10110110000111101111000… |
… | …111001101000010010011000 |
3 | 111010111120102002120001011102 |
4 | 112300331320321220102120 |
5 | 101110344334304311300 |
6 | 552535230014050532 |
7 | 30042401524464164 |
oct | 2660757071502230 |
9 | 433446362501142 |
10 | 100122011010200 |
11 | 299a1563048aa3 |
12 | b290396aa9a48 |
13 | 43b3607b60c7a |
14 | 1aa1d0727bca4 |
15 | b8960b0b00d5 |
hex | 5b0f78e68498 |
100122011010200 has 48 divisors (see below), whose sum is σ = 235972493107080. Its totient is φ = 39500190639360.
The previous prime is 100122011010167. The next prime is 100122011010211. The reversal of 100122011010200 is 2010110221001.
It is a super-2 number, since 2×1001220110102002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 3428821394 + ... + 3428850593.
Almost surely, 2100122011010200 is an apocalyptic number.
100122011010200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100122011010200 is an abundant number, since it is smaller than the sum of its proper divisors (135850482096880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100122011010200 is a wasteful number, since it uses less digits than its factorization.
100122011010200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6857672076 (or 6857672067 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100122011010200 its reverse (2010110221001), we get a palindrome (102132121231201).
The spelling of 100122011010200 in words is "one hundred trillion, one hundred twenty-two billion, eleven million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •