Search a number
-
+
101000655550615 = 520200131110123
BaseRepresentation
bin10110111101110000001100…
…001100100011100010010111
3111020121120100100021101011011
4112331300030030203202113
5101214243320310104430
6554451021031553051
730163025254033462
oct2675601414434227
9436546310241134
10101000655550615
112a200156a81a37
12b3b272b22b787
13444842318a052
141ad265a3422d9
15ba23d387822a
hex5bdc0c323897

101000655550615 has 4 divisors (see below), whose sum is σ = 121200786660744. Its totient is φ = 80800524440488.

The previous prime is 101000655550601. The next prime is 101000655550643. The reversal of 101000655550615 is 516055556000101.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-101000655550615 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 10100065555057 + ... + 10100065555066.

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

Almost surely, 2101000655550615 is an apocalyptic number.

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

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

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

The sum of its prime factors is 20200131110128.

The product of its (nonzero) digits is 112500, while the sum is 40.

The spelling of 101000655550615 in words is "one hundred one trillion, six hundred fifty-five million, five hundred fifty thousand, six hundred fifteen".

Divisors: 1 5 20200131110123 101000655550615