Search a number
-
+
1059107270401 = 16724772560339
BaseRepresentation
bin11110110100101111011…
…01100110111100000001
310202020202000011212110001
433122113231212330001
5114323022430123101
62130314104240001
7136342444155355
oct17322755467401
93666660155401
101059107270401
1137918a496aa4
12151318a70001
1378b47aa665b
1439392513465
151c83a926901
hexf697b66f01

1059107270401 has 8 divisors (see below), whose sum is σ = 1065879783360. Its totient is φ = 1052339883408.

The previous prime is 1059107270387. The next prime is 1059107270437. The reversal of 1059107270401 is 1040727019501.

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

It is a cyclic number.

It is not a de Polignac number, because 1059107270401 - 215 = 1059107237633 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (1059107270201) 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, 866511 + ... + 1693828.

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

Almost surely, 21059107270401 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2562983.

The product of its (nonzero) digits is 17640, while the sum is 37.

The spelling of 1059107270401 in words is "one trillion, fifty-nine billion, one hundred seven million, two hundred seventy thousand, four hundred one".

Divisors: 1 167 2477 413659 2560339 427576613 6341959703 1059107270401