Search a number
-
+
1069131239615 = 5213826247923
BaseRepresentation
bin11111000111011010011…
…00000001000010111111
310210012121121001021011002
433203231030001002333
5120004040044131430
62135052504520515
7140146032410405
oct17435514010277
93705547037132
101069131239615
1138246379247a
12153255a8013b
1379a84736a9a
1439a63915475
151cc2596b845
hexf8ed3010bf

1069131239615 has 4 divisors (see below), whose sum is σ = 1282957487544. Its totient is φ = 855304991688.

The previous prime is 1069131239611. The next prime is 1069131239621. The reversal of 1069131239615 is 5169321319601.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 1069131239615 - 22 = 1069131239611 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

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

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

Almost surely, 21069131239615 is an apocalyptic number.

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

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

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

The sum of its prime factors is 213826247928.

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

The spelling of 1069131239615 in words is "one trillion, sixty-nine billion, one hundred thirty-one million, two hundred thirty-nine thousand, six hundred fifteen".

Divisors: 1 5 213826247923 1069131239615