Search a number
-
+
10142556100601 = 13177424092371
BaseRepresentation
bin1001001110010111111101…
…1101000001011111111001
31022220121201011200111102012
42103211333131001133321
52312133423330204401
633323232001015305
72064526665246041
oct223457735013771
938817634614365
1010142556100601
1132604855593a1
121179841624535
1358759245ca82
14270c8c012721
15128c702728bb
hex9397f7417f9

10142556100601 has 4 divisors (see below), whose sum is σ = 10219980193104. Its totient is φ = 10065132008100.

The previous prime is 10142556100591. The next prime is 10142556100613. The reversal of 10142556100601 is 10600165524101.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 10142556100601 - 238 = 9867678193657 is a prime.

It is a super-2 number, since 2×101425561006012 (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 (10142556100681) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38712046055 + ... + 38712046316.

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

Almost surely, 210142556100601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 77424092502.

The product of its (nonzero) digits is 7200, while the sum is 32.

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

Divisors: 1 131 77424092371 10142556100601