Search a number
-
+
14795995057 = 26875506511
BaseRepresentation
bin11011100011110100…
…01111011110110001
31102012011021102111221
431301322033132301
5220300233320212
610444105305041
71032441611554
oct156172173661
942164242457
1014795995057
116302a54098
122a4b195181
13151a4bbb7c
14a050bc69b
155b8e68807
hex371e8f7b1

14795995057 has 4 divisors (see below), whose sum is σ = 14801504256. Its totient is φ = 14790485860.

The previous prime is 14795995051. The next prime is 14795995063. The reversal of 14795995057 is 75059959741.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is an interprime number because it is at equal distance from previous prime (14795995051) and next prime (14795995063).

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-14795995057 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2750569 + ... + 2755942.

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

Almost surely, 214795995057 is an apocalyptic number.

It is an amenable number.

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

14795995057 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 5509198.

The product of its (nonzero) digits is 17860500, while the sum is 61.

The spelling of 14795995057 in words is "fourteen billion, seven hundred ninety-five million, nine hundred ninety-five thousand, fifty-seven".

Divisors: 1 2687 5506511 14795995057