Search a number
-
+
5500009641 = 371012593121
BaseRepresentation
bin1010001111101001…
…10111110010101001
3112012022020102211210
411013310313302221
542231000302031
62305432143333
7253203211350
oct50764676251
915168212753
105500009641
112372680715
121095b37b49
13698618199
143a265a997
15222cc2746
hex147d37ca9

5500009641 has 16 divisors (see below), whose sum is σ = 8463950208. Its totient is φ = 3111744000.

The previous prime is 5500009631. The next prime is 5500009661. The reversal of 5500009641 is 1469000055.

It is not a de Polignac number, because 5500009641 - 217 = 5499878569 is a prime.

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

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

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

Almost surely, 25500009641 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2593232.

The product of its (nonzero) digits is 5400, while the sum is 30.

The square root of 5500009641 is about 74162.0498705369. The cubic root of 5500009641 is about 1765.1751990590.

Adding to 5500009641 its reverse (1469000055), we get a palindrome (6969009696).

The spelling of 5500009641 in words is "five billion, five hundred million, nine thousand, six hundred forty-one".

Divisors: 1 3 7 21 101 303 707 2121 2593121 7779363 18151847 54455541 261905221 785715663 1833336547 5500009641