Search a number
-
+
100031534551 = 1343178947289
BaseRepresentation
bin101110100101001011…
…0000001010111010111
3100120012100222110112001
41131022112001113113
53114331033101201
6113542010540131
710140606004654
oct1351226012727
9316170873461
10100031534551
1139472214513
1217478437647
139582201040
144bad30cc2b
152906db8301
hex174a5815d7

100031534551 has 8 divisors (see below), whose sum is σ = 110231530640. Its totient is φ = 90189433152.

The previous prime is 100031534549. The next prime is 100031534573. The reversal of 100031534551 is 155435130001.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 100031534551 - 21 = 100031534549 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2100031534551 is an apocalyptic number.

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

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

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

The sum of its prime factors is 178947345.

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

Adding to 100031534551 its reverse (155435130001), we get a palindrome (255466664552).

The spelling of 100031534551 in words is "one hundred billion, thirty-one million, five hundred thirty-four thousand, five hundred fifty-one".

Divisors: 1 13 43 559 178947289 2326314757 7694733427 100031534551