Base | Representation |
---|---|
bin | 11111001110101000… |
… | …001010011101001101 |
3 | 10012112212020220220202 |
4 | 133032220022131031 |
5 | 1022133014444112 |
6 | 23223142223245 |
7 | 2264640151424 |
oct | 371650123515 |
9 | 105485226822 |
10 | 33531406157 |
11 | 13247671817 |
12 | 65b9724b25 |
13 | 3214ba9742 |
14 | 18a14602bb |
15 | d13b8b6c2 |
hex | 7cea0a74d |
33531406157 has 2 divisors, whose sum is σ = 33531406158. Its totient is φ = 33531406156.
The previous prime is 33531406151. The next prime is 33531406193. The reversal of 33531406157 is 75160413533.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27355175236 + 6176230921 = 165394^2 + 78589^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-33531406157 is a prime.
It is a super-2 number, since 2×335314061572 (a number of 22 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 33531406157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (33531406151) 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 as a sum of consecutive naturals, namely, 16765703078 + 16765703079.
It is an arithmetic number, because the mean of its divisors is an integer number (16765703079).
Almost surely, 233531406157 is an apocalyptic number.
It is an amenable number.
33531406157 is a deficient number, since it is larger than the sum of its proper divisors (1).
33531406157 is an equidigital number, since it uses as much as digits as its factorization.
33531406157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 113400, while the sum is 38.
The spelling of 33531406157 in words is "thirty-three billion, five hundred thirty-one million, four hundred six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •