Search a number
-
+
14630656704851 = 119911342138951
BaseRepresentation
bin1101010011100111011100…
…0110001000000101010011
31220210200021121202222022202
43110321313012020011103
53404202041104023401
651041121512553415
73040013212034615
oct324716706100523
956720247688282
1014630656704851
1147309103202a0
1217836293b286b
138218850372a5
143881b0064db5
151a589c36406b
hexd4e77188153

14630656704851 has 8 divisors (see below), whose sum is σ = 15976822084608. Its totient is φ = 13287175605000.

The previous prime is 14630656704821. The next prime is 14630656704857. The reversal of 14630656704851 is 15840765603641.

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

It is not a de Polignac number, because 14630656704851 - 222 = 14630652510547 is a prime.

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

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

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

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

Almost surely, 214630656704851 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1342139953.

The product of its (nonzero) digits is 14515200, while the sum is 56.

The spelling of 14630656704851 in words is "fourteen trillion, six hundred thirty billion, six hundred fifty-six million, seven hundred four thousand, eight hundred fifty-one".

Divisors: 1 11 991 10901 1342138951 14763528461 1330059700441 14630656704851