Search a number
-
+
101111110330 = 2527533672761
BaseRepresentation
bin101111000101010110…
…0010001101010111010
3100122222121101121002011
41132022230101222322
53124033421012310
6114241054000134
710206425154136
oct1361254215272
9318877347064
10101111110330
11399766497aa
1217719aa604a
1396c4a80489
144c728523c6
15296ba6778a
hex178ab11aba

101111110330 has 16 divisors (see below), whose sum is σ = 182066157864. Its totient is φ = 40429742080.

The previous prime is 101111110297. The next prime is 101111110337. The reversal of 101111110330 is 33011111101.

It can be written as a sum of positive squares in 4 ways, for example, as 98708444041 + 2402666289 = 314179^2 + 49017^2 .

It is a self number, because there is not a number n which added to its sum of digits gives 101111110330.

It is not an unprimeable number, because it can be changed into a prime (101111110337) 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, 1808851 + ... + 1863910.

Almost surely, 2101111110330 is an apocalyptic number.

101111110330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 3675521.

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

Adding to 101111110330 its reverse (33011111101), we get a palindrome (134122221431).

The spelling of 101111110330 in words is "one hundred one billion, one hundred eleven million, one hundred ten thousand, three hundred thirty".

Divisors: 1 2 5 10 2753 5506 13765 27530 3672761 7345522 18363805 36727610 10111111033 20222222066 50555555165 101111110330