Base | Representation |
---|---|
bin | 111101111100111101… |
… | …1110111101101001011 |
3 | 110201101221110001210122 |
4 | 1323321323313231023 |
5 | 4134432303142311 |
6 | 141041352533455 |
7 | 12416624245460 |
oct | 1737173675513 |
9 | 421357401718 |
10 | 133042240331 |
11 | 51471970340 |
12 | 2194b6b128b |
13 | c713258540 |
14 | 6621549667 |
15 | 36d9e9d0db |
hex | 1ef9ef7b4b |
133042240331 has 64 divisors (see below), whose sum is σ = 183759916032. Its totient is φ = 92966400000.
The previous prime is 133042240321. The next prime is 133042240361.
133042240331 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 133042240331 - 210 = 133042239307 is a prime.
It is a super-2 number, since 2×1330422403312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 133042240331.
It is not an unprimeable number, because it can be changed into a prime (133042240321) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 9884156 + ... + 9897606.
It is an arithmetic number, because the mean of its divisors is an integer number (2871248688).
Almost surely, 2133042240331 is an apocalyptic number.
133042240331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
133042240331 is a deficient number, since it is larger than the sum of its proper divisors (50717675701).
133042240331 is a wasteful number, since it uses less digits than its factorization.
133042240331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13764.
The product of its (nonzero) digits is 5184, while the sum is 26.
It can be divided in two parts, 133042 and 240331, that added together give a palindrome (373373).
The spelling of 133042240331 in words is "one hundred thirty-three billion, forty-two million, two hundred forty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •