Search a number
-
+
11059213641 = 375925793461
BaseRepresentation
bin10100100110010111…
…00011010101001001
31001112201212021002020
422103023203111021
5140122124314031
65025221155053
7541025523240
oct122313432511
931481767066
1011059213641
114765701993
12218785ba89
13107328a6c8
1476cac5957
1544ad89096
hex2932e3549

11059213641 has 32 divisors (see below), whose sum is σ = 17149363200. Its totient is φ = 6208236480.

The previous prime is 11059213589. The next prime is 11059213657. The reversal of 11059213641 is 14631295011.

It is not a de Polignac number, because 11059213641 - 26 = 11059213577 is a prime.

It is a Curzon number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3193651 + ... + 3197111.

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

Almost surely, 211059213641 is an apocalyptic number.

It is an amenable number.

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

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

11059213641 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 6109.

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

The spelling of 11059213641 in words is "eleven billion, fifty-nine million, two hundred thirteen thousand, six hundred forty-one".

Divisors: 1 3 7 21 59 177 413 1239 2579 3461 7737 10383 18053 24227 54159 72681 152161 204199 456483 612597 1065127 1429393 3195381 4288179 8925919 26777757 62481433 187444299 526629221 1579887663 3686404547 11059213641