Search a number
-
+
1421682715251 = 32157964746139
BaseRepresentation
bin10100101100000010111…
…001001010101001110011
312000220121111211212002200
4110230002321022221303
5141243101233342001
63005040110314243
7204466423456221
oct24540271125163
95026544755080
101421682715251
114a8a28914177
121ab6467b8983
13a40aaab87b6
144cb4a197b11
1526eab9b8086
hex14b02e4aa73

1421682715251 has 6 divisors (see below), whose sum is σ = 2053541699820. Its totient is φ = 947788476828.

The previous prime is 1421682715247. The next prime is 1421682715259. The reversal of 1421682715251 is 1525172861241.

1421682715251 is a `hidden beast` number, since 1 + 42 + 1 + 6 + 82 + 7 + 1 + 525 + 1 = 666.

It is not a de Polignac number, because 1421682715251 - 22 = 1421682715247 is a prime.

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

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 78982373061 + ... + 78982373078.

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

Almost surely, 21421682715251 is an apocalyptic number.

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

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

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

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

The product of its digits is 268800, while the sum is 45.

The spelling of 1421682715251 in words is "one trillion, four hundred twenty-one billion, six hundred eighty-two million, seven hundred fifteen thousand, two hundred fifty-one".

Divisors: 1 3 9 157964746139 473894238417 1421682715251