Search a number
-
+
10590195652 = 224127641519
BaseRepresentation
bin10011101110011100…
…11000111111000100
31000100001022200100121
421313032120333010
5133142042230102
64510504351324
7523302114661
oct116716307704
930301280317
1010590195652
114544986813
122076775544
13cca06257a
147266b6a68
1541eae0b37
hex277398fc4

10590195652 has 12 divisors (see below), whose sum is σ = 18537361920. Its totient is φ = 5293806536.

The previous prime is 10590195641. The next prime is 10590195653. The reversal of 10590195652 is 25659109501.

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

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

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

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

Almost surely, 210590195652 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 121500, while the sum is 43.

The spelling of 10590195652 in words is "ten billion, five hundred ninety million, one hundred ninety-five thousand, six hundred fifty-two".

Divisors: 1 2 4 4127 8254 16508 641519 1283038 2566076 2647548913 5295097826 10590195652