Base | Representation |
---|---|
bin | 111110000010100110… |
… | …0111001001010001111 |
3 | 110201220010002212012221 |
4 | 1330011030321022033 |
5 | 4140324200031421 |
6 | 141112224040211 |
7 | 12424410646306 |
oct | 1740514711217 |
9 | 421803085187 |
10 | 133231252111 |
11 | 51559628721 |
12 | 219a2a63067 |
13 | c743466229 |
14 | 663c6ab43d |
15 | 36eb886841 |
hex | 1f0533928f |
133231252111 has 4 divisors (see below), whose sum is σ = 134604770272. Its totient is φ = 131857733952.
The previous prime is 133231252081. The next prime is 133231252157. The reversal of 133231252111 is 111252132331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111252132331 = 2531 ⋅43955801.
It is a cyclic number.
It is not a de Polignac number, because 133231252111 - 227 = 133097034383 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133231255111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 686758935 + ... + 686759128.
It is an arithmetic number, because the mean of its divisors is an integer number (33651192568).
Almost surely, 2133231252111 is an apocalyptic number.
133231252111 is a deficient number, since it is larger than the sum of its proper divisors (1373518161).
133231252111 is an equidigital number, since it uses as much as digits as its factorization.
133231252111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1373518160.
The product of its digits is 1080, while the sum is 25.
Adding to 133231252111 its reverse (111252132331), we get a palindrome (244483384442).
The spelling of 133231252111 in words is "one hundred thirty-three billion, two hundred thirty-one million, two hundred fifty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •