Search a number
-
+
100110001131 = 3271589047637
BaseRepresentation
bin101110100111100000…
…1010110001111101011
3100120101211121222102200
41131033001112033223
53120011130014011
6113553452431243
710142550653340
oct1351701261753
9316354558380
10100110001131
1139502538628
121749a778523
13959554547a
144bb98d67c7
15290dc17856
hex174f0563eb

100110001131 has 12 divisors (see below), whose sum is σ = 165260954352. Its totient is φ = 57205714896.

The previous prime is 100110001129. The next prime is 100110001139. The reversal of 100110001131 is 131100011001.

It is not a de Polignac number, because 100110001131 - 21 = 100110001129 is a prime.

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

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

It is not an unprimeable number, because it can be changed into a prime (100110001139) by changing a digit.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 794523756 + ... + 794523881.

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

Almost surely, 2100110001131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1589047650 (or 1589047647 counting only the distinct ones).

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

Adding to 100110001131 its reverse (131100011001), we get a palindrome (231210012132).

The spelling of 100110001131 in words is "one hundred billion, one hundred ten million, one thousand, one hundred thirty-one".

Divisors: 1 3 7 9 21 63 1589047637 4767142911 11123333459 14301428733 33370000377 100110001131