Search a number
-
+
302003131310 = 2530200313131
BaseRepresentation
bin1000110010100001100…
…10100001001110101110
31001212112010011122022122
410121100302201032232
514422000300200220
6350423251112542
730550630155326
oct4312062411656
91055463148278
10302003131310
11107095992521
124a6442a2752
132262bb312ca
141088d1b4286
157cc848e425
hex4650ca13ae

302003131310 has 8 divisors (see below), whose sum is σ = 543605636376. Its totient is φ = 120801252520.

The previous prime is 302003131303. The next prime is 302003131327. The reversal of 302003131310 is 13131300203.

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

It is a super-3 number, since 3×3020031313103 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2302003131310 is an apocalyptic number.

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

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

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

The sum of its prime factors is 30200313138.

The product of its (nonzero) digits is 162, while the sum is 17.

Adding to 302003131310 its reverse (13131300203), we get a palindrome (315134431513).

The spelling of 302003131310 in words is "three hundred two billion, three million, one hundred thirty-one thousand, three hundred ten".

Divisors: 1 2 5 10 30200313131 60400626262 151001565655 302003131310