Search a number
-
+
1115070670690 = 25111507067069
BaseRepresentation
bin10000001110011111011…
…001000010011101100010
310221121012012012011101021
4100032133121002131202
5121232131042430230
62212131214200054
7143363330212654
oct20163731023542
93847165164337
101115070670690
1139a998361a39
12160136ab302a
13811c61691b2
143bd80c466d4
151e013ac4c7a
hex1039f642762

1115070670690 has 8 divisors (see below), whose sum is σ = 2007127207260. Its totient is φ = 446028268272.

The previous prime is 1115070670643. The next prime is 1115070670691. The reversal of 1115070670690 is 960760705111.

It can be written as a sum of positive squares in 2 ways, for example, as 1051098603361 + 63972067329 = 1025231^2 + 252927^2 .

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

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

It is not an unprimeable number, because it can be changed into a prime (1115070670691) by changing a digit.

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

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

Almost surely, 21115070670690 is an apocalyptic number.

1115070670690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 111507067076.

The product of its (nonzero) digits is 79380, while the sum is 43.

The spelling of 1115070670690 in words is "one trillion, one hundred fifteen billion, seventy million, six hundred seventy thousand, six hundred ninety".

Divisors: 1 2 5 10 111507067069 223014134138 557535335345 1115070670690