Search a number
-
+
163902791553 = 3531030835167
BaseRepresentation
bin1001100010100101011…
…1100001111110000001
3120200001200000111112020
42120221113201332001
510141133103312203
6203143525352053
714561443512144
oct2305127417601
9520050014466
10163902791553
1163568942226
1227922868629
13125c09b4337
147d0bda205b
1543e4410153
hex26295e1f81

163902791553 has 8 divisors (see below), whose sum is σ = 222660396288. Its totient is φ = 107206857264.

The previous prime is 163902791537. The next prime is 163902791557. The reversal of 163902791553 is 355197209361.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 163902791553 - 24 = 163902791537 is a prime.

It is a Curzon number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 515417425 + ... + 515417742.

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

Almost surely, 2163902791553 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1030835223.

The product of its (nonzero) digits is 1530900, while the sum is 51.

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

Divisors: 1 3 53 159 1030835167 3092505501 54634263851 163902791553