Search a number
-
+
14510166451 = 112177054043
BaseRepresentation
bin11011000001101111…
…11001000110110011
31101110020102211101021
431200313321012303
5214204100311301
610355455120311
71022401244164
oct154067710663
941406384337
1014510166451
116176679900
12298b513097
1314a3213511
149b915776b
1559dd088a1
hex360df91b3

14510166451 has 12 divisors (see below), whose sum is σ = 16887381336. Its totient is φ = 12415113920.

The previous prime is 14510166427. The next prime is 14510166479. The reversal of 14510166451 is 15466101541.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (14510166401) 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 11 ways as a sum of consecutive naturals, for example, 3524965 + ... + 3529078.

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

Almost surely, 214510166451 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 14400, while the sum is 34.

Adding to 14510166451 its reverse (15466101541), we get a palindrome (29976267992).

The spelling of 14510166451 in words is "fourteen billion, five hundred ten million, one hundred sixty-six thousand, four hundred fifty-one".

Divisors: 1 11 17 121 187 2057 7054043 77594473 119918731 853539203 1319106041 14510166451