Search a number
-
+
100111101070 = 2527337366211
BaseRepresentation
bin101110100111100010…
…1100010110010001110
3100120101220200212021011
41131033011202302032
53120011420213240
6113553532155434
710142563214221
oct1351705426216
9316356625234
10100111101070
1139503119a72
121749b008b7a
13959583c016
144bb9b015b8
15290dd836ea
hex174f162c8e

100111101070 has 16 divisors (see below), whose sum is σ = 180207065808. Its totient is φ = 40042866240.

The previous prime is 100111101059. The next prime is 100111101073. The reversal of 100111101070 is 70101111001.

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

It is a congruent number.

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

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

Almost surely, 2100111101070 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 393555.

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

Adding to 100111101070 its reverse (70101111001), we get a palindrome (170212212071).

The spelling of 100111101070 in words is "one hundred billion, one hundred eleven million, one hundred one thousand, seventy".

Divisors: 1 2 5 10 27337 54674 136685 273370 366211 732422 1831055 3662110 10011110107 20022220214 50055550535 100111101070