Search a number
-
+
133565033451061 = 472841809222363
BaseRepresentation
bin11110010111101000001000…
…010111111000111000110101
3122111220200200211101220000001
4132113220020113320320311
5120001312142030413221
61152022532421151301
740063520020101322
oct3627501027707065
9574820624356001
10133565033451061
1139615681393773
1212b9196b55b531
13596b189731634
1424da821459b49
1510694eded6391
hex797a085f8e35

133565033451061 has 4 divisors (see below), whose sum is σ = 136406842673472. Its totient is φ = 130723224228652.

The previous prime is 133565033451019. The next prime is 133565033451079. The reversal of 133565033451061 is 160154330565331.

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.

It is a cyclic number.

It is not a de Polignac number, because 133565033451061 - 227 = 133564899233333 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 (133565033451361) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1420904611135 + ... + 1420904611228.

It is an arithmetic number, because the mean of its divisors is an integer number (34101710668368).

Almost surely, 2133565033451061 is an apocalyptic number.

It is an amenable number.

133565033451061 is a deficient number, since it is larger than the sum of its proper divisors (2841809222411).

133565033451061 is an equidigital number, since it uses as much as digits as its factorization.

133565033451061 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 2841809222410.

The product of its (nonzero) digits is 1458000, while the sum is 46.

The spelling of 133565033451061 in words is "one hundred thirty-three trillion, five hundred sixty-five billion, thirty-three million, four hundred fifty-one thousand, sixty-one".

Divisors: 1 47 2841809222363 133565033451061