Search a number
-
+
1014778539047 = 72131593058931
BaseRepresentation
bin11101100010001011000…
…00111010110000100111
310121000022122211222212002
432301011200322300213
5113111231301222142
62054103253515515
7133213105155500
oct16610540726047
93530278758762
101014778539047
11361402037029
12144807342b9b
1374901c851c0
143718909dba7
151b5e3dd2a32
hexec4583ac27

1014778539047 has 12 divisors (see below), whose sum is σ = 1271261027736. Its totient is φ = 802901700720.

The previous prime is 1014778539043. The next prime is 1014778539059. The reversal of 1014778539047 is 7409358774101.

It is not a de Polignac number, because 1014778539047 - 22 = 1014778539043 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1014778539043) 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 11 ways as a sum of consecutive naturals, for example, 796528829 + ... + 796530102.

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

Almost surely, 21014778539047 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1593058958 (or 1593058951 counting only the distinct ones).

The product of its (nonzero) digits is 5927040, while the sum is 56.

The spelling of 1014778539047 in words is "one trillion, fourteen billion, seven hundred seventy-eight million, five hundred thirty-nine thousand, forty-seven".

Divisors: 1 7 13 49 91 637 1593058931 11151412517 20709766103 78059887619 144968362721 1014778539047