Base | Representation |
---|---|
bin | 111110000100111110… |
… | …1000110111100001011 |
3 | 110202002200011111012201 |
4 | 1330021331012330023 |
5 | 4141010104002311 |
6 | 141124153221031 |
7 | 12426366543355 |
oct | 1741175067413 |
9 | 422080144181 |
10 | 133311000331 |
11 | 5159a647743 |
12 | 21a05701777 |
13 | c756b38b22 |
14 | 664910a0d5 |
15 | 370388a9c1 |
hex | 1f09f46f0b |
133311000331 has 2 divisors, whose sum is σ = 133311000332. Its totient is φ = 133311000330.
The previous prime is 133311000313. The next prime is 133311000337. The reversal of 133311000331 is 133000113331.
It is a happy number.
Together with previous prime (133311000313) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133311000331 - 223 = 133302611723 is a prime.
It is a super-2 number, since 2×1333110003312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133311000299 and 133311000308.
It is not a weakly prime, because it can be changed into another prime (133311000337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66655500165 + 66655500166.
It is an arithmetic number, because the mean of its divisors is an integer number (66655500166).
Almost surely, 2133311000331 is an apocalyptic number.
133311000331 is a deficient number, since it is larger than the sum of its proper divisors (1).
133311000331 is an equidigital number, since it uses as much as digits as its factorization.
133311000331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 133311000331 its reverse (133000113331), we get a palindrome (266311113662).
The spelling of 133311000331 in words is "one hundred thirty-three billion, three hundred eleven million, three hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •