Base | Representation |
---|---|
bin | 10110110001000110010111… |
… | …110101110000000111110000 |
3 | 111010112102220220202210020211 |
4 | 112301012113311300013300 |
5 | 101111022013211201000 |
6 | 552543333531513504 |
7 | 30043143333012664 |
oct | 2661062765600760 |
9 | 433472826683224 |
10 | 100131120022000 |
11 | 299a5407926421 |
12 | b2920b95b8894 |
13 | 43b442a08b892 |
14 | 1aa252cd4c8a4 |
15 | b89990b217ba |
hex | 5b1197d701f0 |
100131120022000 has 80 divisors (see below), whose sum is σ = 242148435695712. Its totient is φ = 40047255705600.
The previous prime is 100131120021983. The next prime is 100131120022057. The reversal of 100131120022000 is 220021131001.
It is a tau number, because it is divible by the number of its divisors (80).
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 15 ways as a sum of consecutive naturals, for example, 12204672 + ... + 18687328.
Almost surely, 2100131120022000 is an apocalyptic number.
100131120022000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100131120022000 is an abundant number, since it is smaller than the sum of its proper divisors (142017315673712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100131120022000 is an equidigital number, since it uses as much as digits as its factorization.
100131120022000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6490403 (or 6490387 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 100131120022000 its reverse (220021131001), we get a palindrome (100351141153001).
The spelling of 100131120022000 in words is "one hundred trillion, one hundred thirty-one billion, one hundred twenty million, twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •