Search a number
-
+
1070241758435 = 51712591079511
BaseRepresentation
bin11111001001011110110…
…00010011110011100011
310210022110222200110120202
433210233120103303203
5120013323342232220
62135355015055415
7140215405563533
oct17445730236343
93708428613522
101070241758435
11382983631723
1215350597156b
1379c0082b505
1439b2b1d14c3
151cc8d1ce275
hexf92f613ce3

1070241758435 has 8 divisors (see below), whose sum is σ = 1359836587296. Its totient is φ = 805829088640.

The previous prime is 1070241758413. The next prime is 1070241758473. The reversal of 1070241758435 is 5348571420701.

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

It is not a de Polignac number, because 1070241758435 - 216 = 1070241692899 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 1070241758435.

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, 6295539671 + ... + 6295539840.

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

Almost surely, 21070241758435 is an apocalyptic number.

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

1070241758435 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 12591079533.

The product of its (nonzero) digits is 940800, while the sum is 47.

The spelling of 1070241758435 in words is "one trillion, seventy billion, two hundred forty-one million, seven hundred fifty-eight thousand, four hundred thirty-five".

Divisors: 1 5 17 85 12591079511 62955397555 214048351687 1070241758435