Search a number
-
+
10116665010055 = 52023333002011
BaseRepresentation
bin1001001100110111100000…
…1110010110011110000111
31022211010212210000211011201
42103031320032112132013
52311222412220310210
633303310505043331
72062622250514042
oct223157016263607
938733783024151
1010116665010055
1132504a97258aa
121174816786547
13584cc742c256
1426d91358bc59
1512825723353a
hex93378396787

10116665010055 has 4 divisors (see below), whose sum is σ = 12139998012072. Its totient is φ = 8093332008040.

The previous prime is 10116665010007. The next prime is 10116665010061. The reversal of 10116665010055 is 55001056661101.

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

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

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 10116665009996 and 10116665010023.

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, 1011666501001 + ... + 1011666501010.

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

Almost surely, 210116665010055 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2023333002016.

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

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

Divisors: 1 5 2023333002011 10116665010055