Base | Representation |
---|---|
bin | 111110000011100000… |
… | …0111001000101010101 |
3 | 110201222020022202200121 |
4 | 1330013000321011111 |
5 | 4140404441114001 |
6 | 141115231511541 |
7 | 12425230265434 |
oct | 1740700710525 |
9 | 421866282617 |
10 | 133261660501 |
11 | 51574807a22 |
12 | 219b10885b1 |
13 | c749852068 |
14 | 664274511b |
15 | 36ee3916a1 |
hex | 1f07039155 |
133261660501 has 4 divisors (see below), whose sum is σ = 133305746112. Its totient is φ = 133217574892.
The previous prime is 133261660489. The next prime is 133261660507. The reversal of 133261660501 is 105066162331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 105066162331 = 13 ⋅8082012487.
It is a cyclic number.
It is not a de Polignac number, because 133261660501 - 29 = 133261659989 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 (133261660507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22038271 + ... + 22044316.
It is an arithmetic number, because the mean of its divisors is an integer number (33326436528).
Almost surely, 2133261660501 is an apocalyptic number.
It is an amenable number.
133261660501 is a deficient number, since it is larger than the sum of its proper divisors (44085611).
133261660501 is an equidigital number, since it uses as much as digits as its factorization.
133261660501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44085610.
The product of its (nonzero) digits is 19440, while the sum is 34.
The spelling of 133261660501 in words is "one hundred thirty-three billion, two hundred sixty-one million, six hundred sixty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •