Search a number
-
+
30111111015 = 352377844513
BaseRepresentation
bin11100000010110000…
…110001011101100111
32212201111100221000220
4130002300301131213
5443131421023030
621455521335423
72114116135446
oct340260613547
985644327026
1030111111015
1111851a34417
125a04197573
132abb3c906b
1416590ccd5d
15bb3775a10
hex702c31767

30111111015 has 16 divisors (see below), whose sum is σ = 48198103008. Its totient is φ = 16052484096.

The previous prime is 30111110993. The next prime is 30111111049. The reversal of 30111111015 is 51011111103.

It is not a de Polignac number, because 30111111015 - 25 = 30111110983 is a prime.

It is a super-3 number, since 3×301111110153 (a number of 32 digits) contains 333 as substring.

It is a Harshad number since it is a multiple of its sum of digits (15).

It is a junction number, because it is equal to n+sod(n) for n = 30111110985 and 30111111003.

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 15 ways as a sum of consecutive naturals, for example, 386602 + ... + 457911.

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

Almost surely, 230111111015 is an apocalyptic number.

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

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

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

The sum of its prime factors is 846898.

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

Adding to 30111111015 its reverse (51011111103), we get a palindrome (81122222118).

The spelling of 30111111015 in words is "thirty billion, one hundred eleven million, one hundred eleven thousand, fifteen".

Divisors: 1 3 5 15 2377 7131 11885 35655 844513 2533539 4222565 12667695 2007407401 6022222203 10037037005 30111111015