Search a number
-
+
1054040406261 = 31193294506959
BaseRepresentation
bin11110101011010011011…
…01000011100011110101
310201202122212222111112020
433111221231003203311
5114232133321000021
62124115223543353
7136103050424613
oct17255155034365
93652585874466
101054040406261
1137701a36aa77
12150343bbab59
137851b1366ab
14390316086b3
151c640bb37c6
hexf569b438f5

1054040406261 has 8 divisors (see below), whose sum is σ = 1406565240960. Its totient is φ = 702104587872.

The previous prime is 1054040406257. The next prime is 1054040406301. The reversal of 1054040406261 is 1626040404501.

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

It is not a de Polignac number, because 1054040406261 - 22 = 1054040406257 is a prime.

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

It is a congruent number.

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

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, 147249901 + ... + 147257058.

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

Almost surely, 21054040406261 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 294508155.

The product of its (nonzero) digits is 23040, while the sum is 33.

The spelling of 1054040406261 in words is "one trillion, fifty-four billion, forty million, four hundred six thousand, two hundred sixty-one".

Divisors: 1 3 1193 3579 294506959 883520877 351346802087 1054040406261