Search a number
-
+
101000002131 = 3271603174637
BaseRepresentation
bin101111000010000010…
…0011011101001010011
3100122200212022201021200
41132010010123221103
53123322000032011
6114222044322243
710203605565420
oct1360404335123
9318625281250
10101000002131
1139919960546
12176a8843383
1396a7a4a892
144c61bacd47
152961e1b856
hex178411ba53

101000002131 has 12 divisors (see below), whose sum is σ = 166730162352. Its totient is φ = 57714286896.

The previous prime is 101000002123. The next prime is 101000002133. The reversal of 101000002131 is 131200000101.

It is not a de Polignac number, because 101000002131 - 23 = 101000002123 is a prime.

It is a super-2 number, since 2×1010000021312 (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 (101000002133) by changing a digit.

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 11 ways as a sum of consecutive naturals, for example, 801587256 + ... + 801587381.

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

Almost surely, 2101000002131 is an apocalyptic number.

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

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

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

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

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

Adding to 101000002131 its reverse (131200000101), we get a palindrome (232200002232).

The spelling of 101000002131 in words is "one hundred one billion, two thousand, one hundred thirty-one".

Divisors: 1 3 7 9 21 63 1603174637 4809523911 11222222459 14428571733 33666667377 101000002131