Search a number
-
+
14505056755 = 57414430193
BaseRepresentation
bin11011000001001000…
…11001100111110011
31101102212211020012021
431200210121213303
5214201243304010
610355153412311
71022306643130
oct154044314763
941385736167
1014505056755
1161737a9912
12298986a097
1314a2144827
149b85c7587
1559d6498da
hex3609199f3

14505056755 has 8 divisors (see below), whose sum is σ = 19892649312. Its totient is φ = 9946324608.

The previous prime is 14505056749. The next prime is 14505056771. The reversal of 14505056755 is 55765050541.

14505056755 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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 14505056755 - 23 = 14505056747 is a prime.

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

It is a Duffinian number.

It is an unprimeable number.

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

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

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

Almost surely, 214505056755 is an apocalyptic number.

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

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

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

The sum of its prime factors is 414430205.

The product of its (nonzero) digits is 525000, while the sum is 43.

The spelling of 14505056755 in words is "fourteen billion, five hundred five million, fifty-six thousand, seven hundred fifty-five".

Divisors: 1 5 7 35 414430193 2072150965 2901011351 14505056755