Search a number
-
+
1004335420135 = 5478694196183
BaseRepresentation
bin11101001110101110000…
…11100101001011100111
310120000100212021120212011
432213113003211023213
5112423334331421020
62045215121335051
7132363240133615
oct16472703451347
93500325246764
101004335420135
11357a33186243
12142791a97487
137392953a0b8
14368781506b5
151b1d219535a
hexe9d70e52e7

1004335420135 has 8 divisors (see below), whose sum is σ = 1205227968480. Its totient is φ = 803451359904.

The previous prime is 1004335420073. The next prime is 1004335420157. The reversal of 1004335420135 is 5310245334001.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 1004335420135 - 219 = 1004334895847 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 1004335420097 and 1004335420106.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1858747 + ... + 2337436.

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

Almost surely, 21004335420135 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4244057.

The product of its (nonzero) digits is 21600, while the sum is 31.

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

Divisors: 1 5 47869 239345 4196183 20980915 200867084027 1004335420135