Search a number
-
+
306438010070 = 2530643801007
BaseRepresentation
bin1000111010110010010…
…00001111010011010110
31002021222012011211021112
410131121020033103112
520010041112310240
6352435314015022
731065551052113
oct4353110172326
91067865154245
10306438010070
11108a612a4585
124b481577472
1322b87886b1a
1410b901ab90a
157e879b7665
hex475920f4d6

306438010070 has 8 divisors (see below), whose sum is σ = 551588418144. Its totient is φ = 122575204024.

The previous prime is 306438010037. The next prime is 306438010111. The reversal of 306438010070 is 70010834603.

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

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

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 15321900494 + ... + 15321900513.

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

Almost surely, 2306438010070 is an apocalyptic number.

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

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

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

The sum of its prime factors is 30643801014.

The product of its (nonzero) digits is 12096, while the sum is 32.

Adding to 306438010070 its reverse (70010834603), we get a palindrome (376448844673).

The spelling of 306438010070 in words is "three hundred six billion, four hundred thirty-eight million, ten thousand, seventy".

Divisors: 1 2 5 10 30643801007 61287602014 153219005035 306438010070