Search a number
-
+
10990569153 = 33663523051
BaseRepresentation
bin10100011110001011…
…01100011011000001
31001100221200202112210
422033011230123001
5140002041203103
65014330012333
7536233203444
oct121705543301
931327622483
1010990569153
11472a987303
1221688770a9
131061ca4b75
1476393765b
15444d29e03
hex28f16c6c1

10990569153 has 4 divisors (see below), whose sum is σ = 14654092208. Its totient is φ = 7327046100.

The previous prime is 10990569151. The next prime is 10990569167. The reversal of 10990569153 is 35196509901.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 10990569153 - 21 = 10990569151 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (10990569151) 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, 1831761523 + ... + 1831761528.

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

Almost surely, 210990569153 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3663523054.

The product of its (nonzero) digits is 328050, while the sum is 48.

The spelling of 10990569153 in words is "ten billion, nine hundred ninety million, five hundred sixty-nine thousand, one hundred fifty-three".

Divisors: 1 3 3663523051 10990569153