Search a number
-
+
30273105063 = 367150612463
BaseRepresentation
bin11100001100011010…
…101110110010100111
32220010210012002002110
4130030122232302213
5443444403330223
621523545412103
72121124101345
oct341432566247
986123162073
1030273105063
11119254189a3
125a4a49a033
132b15b37326
14167281a995
15bc2ac3d93
hex70c6aeca7

30273105063 has 8 divisors (see below), whose sum is σ = 40966590208. Its totient is φ = 19880844984.

The previous prime is 30273105059. The next prime is 30273105067. The reversal of 30273105063 is 36050137203.

It is an interprime number because it is at equal distance from previous prime (30273105059) and next prime (30273105067).

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

It is not a de Polignac number, because 30273105063 - 22 = 30273105059 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 30273105063.

It is a congruent number.

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

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

Almost surely, 230273105063 is an apocalyptic number.

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

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

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

The sum of its prime factors is 150612533.

The product of its (nonzero) digits is 11340, while the sum is 30.

The spelling of 30273105063 in words is "thirty billion, two hundred seventy-three million, one hundred five thousand, sixty-three".

Divisors: 1 3 67 201 150612463 451837389 10091035021 30273105063