Base | Representation |
---|---|
bin | 111110000001001110… |
… | …0100000011101111111 |
3 | 110201202220002200221122 |
4 | 1330002130200131333 |
5 | 4140230330414011 |
6 | 141103453021155 |
7 | 12423306636245 |
oct | 1740234403577 |
9 | 421686080848 |
10 | 133185013631 |
11 | 51535516aaa |
12 | 2198b4847bb |
13 | c7369c6c97 |
14 | 66364b2795 |
15 | 36e77a13db |
hex | 1f0272077f |
133185013631 has 8 divisors (see below), whose sum is σ = 138039517440. Its totient is φ = 128396557728.
The previous prime is 133185013627. The next prime is 133185013649. The reversal of 133185013631 is 136310581331.
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 133185013631 - 22 = 133185013627 is a prime.
It is a super-2 number, since 2×1331850136312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133185013591 and 133185013600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133185013681) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16507871 + ... + 16515936.
It is an arithmetic number, because the mean of its divisors is an integer number (17254939680).
Almost surely, 2133185013631 is an apocalyptic number.
133185013631 is a deficient number, since it is larger than the sum of its proper divisors (4854503809).
133185013631 is a wasteful number, since it uses less digits than its factorization.
133185013631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33023953.
The product of its (nonzero) digits is 19440, while the sum is 35.
Adding to 133185013631 its reverse (136310581331), we get a palindrome (269495594962).
The spelling of 133185013631 in words is "one hundred thirty-three billion, one hundred eighty-five million, thirteen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •