Search a number
-
+
14517040272 = 24372231012657
BaseRepresentation
bin11011000010100100…
…00111010010010000
31101110201101001111020
431201102013102100
5214212330242042
610400302315440
71022513543400
oct154122072220
941421331436
1014517040272
11617a544249
122991888b80
1314a477c177
149ba026800
1559e7153ec
hex361487490

14517040272 has 240 divisors, whose sum is σ = 45989949312. Its totient is φ = 3926630400.

The previous prime is 14517040271. The next prime is 14517040277. The reversal of 14517040272 is 27204071541.

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

Almost surely, 214517040272 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 14517040272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22994974656).

14517040272 is an abundant number, since it is smaller than the sum of its proper divisors (31472909040).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 15680, while the sum is 33.

The spelling of 14517040272 in words is "fourteen billion, five hundred seventeen million, forty thousand, two hundred seventy-two".