Search a number
-
+
109011064947 = 394738370667
BaseRepresentation
bin110010110000110010…
…0001101100001110011
3101102101011112212111220
41211201210031201303
53241223313034242
6122025021240123
710606252522611
oct1454144154163
9342334485456
10109011064947
114225a9a4614
1219163703043
13a383665235
1453c1b166b1
152c8039ebec
hex196190d873

109011064947 has 8 divisors (see below), whose sum is σ = 145501573056. Its totient is φ = 72597300072.

The previous prime is 109011064933. The next prime is 109011064969. The reversal of 109011064947 is 749460110901.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 109011064947 - 28 = 109011064691 is a prime.

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

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

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

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

Almost surely, 2109011064947 is an apocalyptic number.

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

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

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

The sum of its prime factors is 38371617.

The product of its (nonzero) digits is 54432, while the sum is 42.

The spelling of 109011064947 in words is "one hundred nine billion, eleven million, sixty-four thousand, nine hundred forty-seven".

Divisors: 1 3 947 2841 38370667 115112001 36337021649 109011064947