Base | Representation |
---|---|
bin | 111101000000001100… |
… | …0111010010111001001 |
3 | 110112010211022121021102 |
4 | 1322000120322113021 |
5 | 4121243234024113 |
6 | 140103145351145 |
7 | 12315243256625 |
oct | 1720030722711 |
9 | 415124277242 |
10 | 131003033033 |
11 | 50615884754 |
12 | 214807984b5 |
13 | c4799343c2 |
14 | 64aa7a6185 |
15 | 361ae43758 |
hex | 1e8063a5c9 |
131003033033 has 8 divisors (see below), whose sum is σ = 132307885056. Its totient is φ = 129698334000.
The previous prime is 131003033027. The next prime is 131003033059. The reversal of 131003033033 is 330330300131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131003033033 - 218 = 131002770889 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 131003032996 and 131003033014.
It is not an unprimeable number, because it can be changed into a prime (131003039033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2547110 + ... + 2598032.
It is an arithmetic number, because the mean of its divisors is an integer number (16538485632).
Almost surely, 2131003033033 is an apocalyptic number.
It is an amenable number.
131003033033 is a deficient number, since it is larger than the sum of its proper divisors (1304852023).
131003033033 is a wasteful number, since it uses less digits than its factorization.
131003033033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76495.
The product of its (nonzero) digits is 729, while the sum is 20.
Adding to 131003033033 its reverse (330330300131), we get a palindrome (461333333164).
The spelling of 131003033033 in words is "one hundred thirty-one billion, three million, thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •