Base | Representation |
---|---|
bin | 10111011100110010001101… |
… | …101011111100010010000000 |
3 | 111112011102122021120220011001 |
4 | 113130302031223330102000 |
5 | 102004213123221134422 |
6 | 1003202412351101344 |
7 | 30503060102161624 |
oct | 2734621553742200 |
9 | 445142567526131 |
10 | 103133131818112 |
11 | 2a952574266310 |
12 | b697a85211854 |
13 | 4571549636086 |
14 | 1b679550d1184 |
15 | bdcae1ca8227 |
hex | 5dcc8dafc480 |
103133131818112 has 32 divisors (see below), whose sum is σ = 224138766596400. Its totient is φ = 46878696280320.
The previous prime is 103133131818001. The next prime is 103133131818113. The reversal of 103133131818112 is 211818131331301.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×1031331318181122 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103133131818113) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 36623980062 + ... + 36623982877.
Almost surely, 2103133131818112 is an apocalyptic number.
It is an amenable number.
103133131818112 is an abundant number, since it is smaller than the sum of its proper divisors (121005634778288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103133131818112 is an equidigital number, since it uses as much as digits as its factorization.
103133131818112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73247962964 (or 73247962952 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 37.
The spelling of 103133131818112 in words is "one hundred three trillion, one hundred thirty-three billion, one hundred thirty-one million, eight hundred eighteen thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •