Search a number
-
+
142541015625110 = 2514254101562511
BaseRepresentation
bin100000011010001111101010…
…100110100010110110010110
3200200200210021110102202001002
4200122033222212202312112
5122140343000000000420
61223054234422303302
742011151150523454
oct4032175246426626
9620623243382032
10142541015625110
114146633a313763
1213ba14a1887b32
13616c7386c329b
14272b0443c59d4
151172c43d50075
hex81a3ea9a2d96

142541015625110 has 8 divisors (see below), whose sum is σ = 256573828125216. Its totient is φ = 57016406250040.

The previous prime is 142541015625067. The next prime is 142541015625133. The reversal of 142541015625110 is 11526510145241.

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

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

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, 7127050781246 + ... + 7127050781265.

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

Almost surely, 2142541015625110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 14254101562518.

The product of its (nonzero) digits is 48000, while the sum is 38.

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

Divisors: 1 2 5 10 14254101562511 28508203125022 71270507812555 142541015625110