Search a number
-
+
133102494769 is a prime number
BaseRepresentation
bin111101111110110000…
…1101110010000110001
3110201120010211022100111
41323331201232100301
54140043214313034
6141051344221321
712421255352416
oct1737541562061
9421503738314
10133102494769
11514a29853a2
122196790a841
13c72289425a
14662955210d
1536e0401364
hex1efd86e431

133102494769 has 2 divisors, whose sum is σ = 133102494770. Its totient is φ = 133102494768.

The previous prime is 133102494757. The next prime is 133102494773. The reversal of 133102494769 is 967494201331.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 132431943744 + 670551025 = 363912^2 + 25895^2 .

It is a cyclic number.

It is not a de Polignac number, because 133102494769 - 27 = 133102494641 is a prime.

It is a super-2 number, since 2×1331024947692 (a number of 23 digits) contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (133102494739) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66551247384 + 66551247385.

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

Almost surely, 2133102494769 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 979776, while the sum is 49.

The spelling of 133102494769 in words is "one hundred thirty-three billion, one hundred two million, four hundred ninety-four thousand, seven hundred sixty-nine".