Search a number
-
+
140113251010425 = 352711139647269779
BaseRepresentation
bin11111110110111010101000…
…100011100000011101111001
3200101002200210100222221212210
4133312322220203200131321
5121331103414224313200
61213555050001125333
741340563656013040
oct3766725043403571
9611080710887783
10140113251010425
114070a7724a5630
121386aa78329849
1360248135c93c4
142685736177557
15112ea01c0b650
hex7f6ea88e0779

140113251010425 has 192 divisors, whose sum is σ = 291343752806400. Its totient is φ = 57720405945600.

The previous prime is 140113251010417. The next prime is 140113251010441. The reversal of 140113251010425 is 524010152311041.

It is not a de Polignac number, because 140113251010425 - 23 = 140113251010417 is a prime.

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

It is an unprimeable number.

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 519228186 + ... + 519497964.

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

Almost surely, 2140113251010425 is an apocalyptic number.

140113251010425 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

It is an amenable number.

140113251010425 is an abundant number, since it is smaller than the sum of its proper divisors (151230501795975).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 270596 (or 270591 counting only the distinct ones).

The product of its (nonzero) digits is 4800, while the sum is 30.

The spelling of 140113251010425 in words is "one hundred forty trillion, one hundred thirteen billion, two hundred fifty-one million, ten thousand, four hundred twenty-five".