Base | Representation |
---|---|
bin | 111101111111100111… |
… | …0100111011001001011 |
3 | 110201122010112120111112 |
4 | 1323333032213121023 |
5 | 4140123021242311 |
6 | 141054244120535 |
7 | 12422053112552 |
oct | 1737716473113 |
9 | 421563476445 |
10 | 133131040331 |
11 | 51508002073 |
12 | 2197539614b |
13 | c72877a213 |
14 | 662d262d99 |
15 | 36e2b8e28b |
hex | 1eff3a764b |
133131040331 has 8 divisors (see below), whose sum is σ = 135745847424. Its totient is φ = 130530179520.
The previous prime is 133131040327. The next prime is 133131040333. The reversal of 133131040331 is 133040131331.
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 133131040331 - 22 = 133131040327 is a prime.
It is a super-2 number, since 2×1331310403312 (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 = 133131040297 and 133131040306.
It is not an unprimeable number, because it can be changed into a prime (133131040333) 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, 3467291 + ... + 3505476.
It is an arithmetic number, because the mean of its divisors is an integer number (16968230928).
Almost surely, 2133131040331 is an apocalyptic number.
133131040331 is a deficient number, since it is larger than the sum of its proper divisors (2614807093).
133131040331 is an equidigital number, since it uses as much as digits as its factorization.
133131040331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6973141.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 133131040331 its reverse (133040131331), we get a palindrome (266171171662).
The spelling of 133131040331 in words is "one hundred thirty-three billion, one hundred thirty-one million, forty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.166 sec. • engine limits •