Search a number
-
+
305530050505 = 5101605010001
BaseRepresentation
bin1000111001000110000…
…00101001011111001001
31002012121220200200220111
410130203000221133021
520001211143104010
6352205241154321
731034214402511
oct4344300513711
91065556620814
10305530050505
11108635826079
124b26948b9a1
1322a71734544
1410b0577c841
157e32e1758a
hex47230297c9

305530050505 has 8 divisors (see below), whose sum is σ = 370266121224. Its totient is φ = 242004000000.

The previous prime is 305530050499. The next prime is 305530050517. The reversal of 305530050505 is 505050035503.

It can be written as a sum of positive squares in 4 ways, for example, as 206810295696 + 98719754809 = 454764^2 + 314197^2 .

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

It is not a de Polignac number, because 305530050505 - 223 = 305521661897 is a prime.

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

It is a Duffinian 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 7 ways as a sum of consecutive naturals, for example, 302504496 + ... + 302505505.

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

Almost surely, 2305530050505 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 605010107.

The product of its (nonzero) digits is 28125, while the sum is 31.

The spelling of 305530050505 in words is "three hundred five billion, five hundred thirty million, fifty thousand, five hundred five".

Divisors: 1 5 101 505 605010001 3025050005 61106010101 305530050505