Search a number
-
+
10600555001051 = 61991710042749
BaseRepresentation
bin1001101001000010001001…
…0100001011010011011011
31101112101212220102021122002
42122100202110023103123
52342134414040013201
634313454442551215
72142602430543221
oct232204224132333
941471786367562
1010600555001051
113417740a40074
12123256050850b
135bb821a87602
142890d8da4b11
15135b2889076b
hex9a42250b4db

10600555001051 has 4 divisors (see below), whose sum is σ = 10602265050000. Its totient is φ = 10598844952104.

The previous prime is 10600555001017. The next prime is 10600555001053. The reversal of 10600555001051 is 15010055500601.

It is a happy number.

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 10600555001051 - 226 = 10600487892187 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 210600555001051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1710048948.

The product of its (nonzero) digits is 3750, while the sum is 29.

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

Divisors: 1 6199 1710042749 10600555001051