Search a number
-
+
72009415147 = 160694481263
BaseRepresentation
bin100001100010000011…
…0000111100111101011
320212212110102022020211
41003010012013213223
52134433402241042
653025231401551
75126313633565
oct1030406074753
9225773368224
1072009415147
11285a248a44a
1211b579832b7
136a3783a2b7
1436b1842335
151d16c33017
hex10c41879eb

72009415147 has 4 divisors (see below), whose sum is σ = 72013912480. Its totient is φ = 72004917816.

The previous prime is 72009415097. The next prime is 72009415157. The reversal of 72009415147 is 74151490027.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 74151490027 = 263281944829.

It is a cyclic number.

It is not a de Polignac number, because 72009415147 - 27 = 72009415019 is a prime.

It is a super-3 number, since 3×720094151473 (a number of 34 digits) contains 333 as substring.

It is a Duffinian number.

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

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 3 ways as a sum of consecutive naturals, for example, 2224563 + ... + 2256700.

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

Almost surely, 272009415147 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4497332.

The product of its (nonzero) digits is 70560, while the sum is 40.

The spelling of 72009415147 in words is "seventy-two billion, nine million, four hundred fifteen thousand, one hundred forty-seven".

Divisors: 1 16069 4481263 72009415147