Search a number
-
+
10621404755611 = 13817031135047
BaseRepresentation
bin1001101010001111110100…
…0011101011011010011011
31101121101200221220112222221
42122203331003223122123
52343010114104134421
634331223405324511
72144241211536526
oct232437503533233
941541627815887
1010621404755611
1134255700a3291
1212365bab66737
135c07955158a0
1428a116087bbd
15136449010841
hex9a8fd0eb69b

10621404755611 has 4 divisors (see below), whose sum is σ = 11438435890672. Its totient is φ = 9804373620552.

The previous prime is 10621404755587. The next prime is 10621404755617. The reversal of 10621404755611 is 11655740412601.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 10621404755611 - 25 = 10621404755579 is a prime.

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

It is a Duffinian number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 408515567511 + ... + 408515567536.

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

Almost surely, 210621404755611 is an apocalyptic number.

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

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

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

The sum of its prime factors is 817031135060.

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

The spelling of 10621404755611 in words is "ten trillion, six hundred twenty-one billion, four hundred four million, seven hundred fifty-five thousand, six hundred eleven".

Divisors: 1 13 817031135047 10621404755611