Search a number
-
+
30923631563 = 112463551981
BaseRepresentation
bin11100110011001100…
…010010101111001011
32221211010021020200112
4130303030102233023
51001312422202223
622112304424535
72143213350146
oct346314225713
987733236615
1030923631563
1112129647100
125bb031814b
132bba843b56
1416d4d9705d
15c0ec72778
hex733312bcb

30923631563 has 12 divisors (see below), whose sum is σ = 34063913184. Its totient is φ = 28051623600.

The previous prime is 30923631559. The next prime is 30923631569. The reversal of 30923631563 is 36513632903.

It is a happy number.

It is not a de Polignac number, because 30923631563 - 22 = 30923631559 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 30923631563.

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

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

Almost surely, 230923631563 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 262440, while the sum is 41.

The spelling of 30923631563 in words is "thirty billion, nine hundred twenty-three million, six hundred thirty-one thousand, five hundred sixty-three".

Divisors: 1 11 121 463 5093 56023 551981 6071791 66789701 255567203 2811239233 30923631563