Search a number
-
+
1104010333469 is a prime number
BaseRepresentation
bin10000000100001100001…
…001001100110100011101
310220112122101012211000222
4100010030021030310131
5121042003121132334
62203101512531125
7142522255666601
oct20041411146435
93815571184028
101104010333469
1139623206297a
12159b6a9b0aa5
13801528a7264
143b611d4b501
151dab7ab7d2e
hex1010c24cd1d

1104010333469 has 2 divisors, whose sum is σ = 1104010333470. Its totient is φ = 1104010333468.

The previous prime is 1104010333427. The next prime is 1104010333471. The reversal of 1104010333469 is 9643330104011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 810855225625 + 293155107844 = 900475^2 + 541438^2 .

It is an emirp because it is prime and its reverse (9643330104011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1104010333469 - 228 = 1103741898013 is a prime.

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

Together with 1104010333471, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 21104010333469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 23328, while the sum is 35.

The spelling of 1104010333469 in words is "one trillion, one hundred four billion, ten million, three hundred thirty-three thousand, four hundred sixty-nine".