[go: up one dir, main page]

Search a number
-
+
14101015 = 514471949
BaseRepresentation
bin110101110010…
…101000010111
3222112101221211
4311302220113
512102213030
61222122251
7230566555
oct65625027
928471854
1014101015
117a61335
124880387
132bc93c6
141c30bd5
15138812a
hexd72a17

14101015 has 8 divisors (see below), whose sum is σ = 16941600. Its totient is φ = 11267232.

The previous prime is 14100991. The next prime is 14101019. The reversal of 14101015 is 51010141.

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 14101015 - 29 = 14100503 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 214101015 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3401.

The product of its (nonzero) digits is 20, while the sum is 13.

The square root of 14101015 is about 3755.1318219205. The cubic root of 14101015 is about 241.5925057157.

Adding to 14101015 its reverse (51010141), we get a palindrome (65111156).

The spelling of 14101015 in words is "fourteen million, one hundred one thousand, fifteen".

Divisors: 1 5 1447 1949 7235 9745 2820203 14101015