Base | Representation |
---|---|
bin | 10111011111011000001011… |
… | …010000001011110011010000 |
3 | 111112210110121100220200102110 |
4 | 113133120023100023303100 |
5 | 102020123102011130000 |
6 | 1003420323142145320 |
7 | 30521666055633621 |
oct | 2737301320136320 |
9 | 445713540820373 |
10 | 103311332130000 |
11 | 2aa110a9737145 |
12 | b706518122240 |
13 | 45852a84694c7 |
14 | 1b7241bc95a48 |
15 | be25714ba850 |
hex | 5df60b40bcd0 |
103311332130000 has 100 divisors (see below), whose sum is σ = 333502755056768. Its totient is φ = 27549688560000.
The previous prime is 103311332129977. The next prime is 103311332130043. The reversal of 103311332130000 is 31233113301.
It is a tau number, because it is divible by the number of its divisors (100).
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 19 ways as a sum of consecutive naturals, for example, 1721825536 + ... + 1721885535.
Almost surely, 2103311332130000 is an apocalyptic number.
103311332130000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103311332130000 is an abundant number, since it is smaller than the sum of its proper divisors (230191422926768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103311332130000 is an equidigital number, since it uses as much as digits as its factorization.
103311332130000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3443711102 (or 3443711081 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 103311332130000 its reverse (31233113301), we get a palindrome (103342565243301).
The spelling of 103311332130000 in words is "one hundred three trillion, three hundred eleven billion, three hundred thirty-two million, one hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •