Base | Representation |
---|---|
bin | 11001101001001000000… |
… | …11001111011100001101 |
3 | 10010020012111112012220220 |
4 | 30310210003033130031 |
5 | 103413414210001013 |
6 | 1512432010501553 |
7 | 120440545665225 |
oct | 14644403173415 |
9 | 3106174465826 |
10 | 881073125133 |
11 | 30a72a89a653 |
12 | 1229117348b9 |
13 | 65114512776 |
14 | 30903845085 |
15 | 17dbaad8b23 |
hex | cd240cf70d |
881073125133 has 8 divisors (see below), whose sum is σ = 1186169644608. Its totient is φ = 581679344544.
The previous prime is 881073125123. The next prime is 881073125143. The reversal of 881073125133 is 331521370188.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (881073125123) and next prime (881073125143).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 881073125133 - 212 = 881073121037 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (881073125123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1425684360 + ... + 1425684977.
It is an arithmetic number, because the mean of its divisors is an integer number (148271205576).
Almost surely, 2881073125133 is an apocalyptic number.
It is an amenable number.
881073125133 is a deficient number, since it is larger than the sum of its proper divisors (305096519475).
881073125133 is a wasteful number, since it uses less digits than its factorization.
881073125133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2851369443.
The product of its (nonzero) digits is 120960, while the sum is 42.
The spelling of 881073125133 in words is "eight hundred eighty-one billion, seventy-three million, one hundred twenty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •