Search a number
-
+
10601005051 = 713116494561
BaseRepresentation
bin10011101111101111…
…00111111111111011
31000100210122212001201
421313313213333323
5133202324130201
64511532155031
7523463025160
oct116767477773
930323585051
1010601005051
11454aa99aaa
12207a308a77
13ccc378670
14727ccc067
15420a28801
hex277de7ffb

10601005051 has 8 divisors (see below), whose sum is σ = 13047390944. Its totient is φ = 8387608320.

The previous prime is 10601005033. The next prime is 10601005081. The reversal of 10601005051 is 15050010601.

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

It is not a de Polignac number, because 10601005051 - 27 = 10601004923 is a prime.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 58247190 + ... + 58247371.

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

Almost surely, 210601005051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 116494581.

The product of its (nonzero) digits is 150, while the sum is 19.

Adding to 10601005051 its reverse (15050010601), we get a palindrome (25651015652).

The spelling of 10601005051 in words is "ten billion, six hundred one million, five thousand, fifty-one".

Divisors: 1 7 13 91 116494561 815461927 1514429293 10601005051