Search a number
BaseRepresentation
bin111100011110111101000111…
…110110110100010011111101
31021212212022022121210022121202
4330132331013312310103331
5234331301442241431031
62341431150445305245
7110013405622316501
oct7436750766642375
91255768277708552
10266010005030141
1177839233a78059
1225a02630565225
13b557835c29028
144998d4ac1c301
1520b47e612d2cb
hexf1ef47db44fd

266010005030141 has 8 divisors (see below), whose sum is σ = 269101422997344. Its totient is φ = 262927560701200.

The previous prime is 266010005030083. The next prime is 266010005030153. The reversal of 266010005030141 is 141030500010662.

It is a happy number.

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

It is a cyclic number.

It is not a de Polignac number, because 266010005030141 - 210 = 266010005029117 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (31) of ones.

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

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

Almost surely, 2266010005030141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 4486819131.

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

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