Search a number
-
+
100001550061 = 714285935723
BaseRepresentation
bin101110100100010001…
…1101000111011101101
3100120010021120002112101
41131020203220323231
53114300344100221
6113535020135101
710140063102430
oct1351043507355
9316107502471
10100001550061
11394572a4746
121746a397491
139578c3313a
144ba9345817
152904443d91
hex17488e8eed

100001550061 has 4 divisors (see below), whose sum is σ = 114287485792. Its totient is φ = 85715614332.

The previous prime is 100001550007. The next prime is 100001550097. The reversal of 100001550061 is 160055100001.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 100001550061 - 211 = 100001548013 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 (100001550361) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7142967855 + ... + 7142967868.

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

Almost surely, 2100001550061 is an apocalyptic number.

It is an amenable number.

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

100001550061 is an equidigital number, since it uses as much as digits as its factorization.

100001550061 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 14285935730.

The product of its (nonzero) digits is 150, while the sum is 19.

Adding to 100001550061 its reverse (160055100001), we get a palindrome (260056650062).

The spelling of 100001550061 in words is "one hundred billion, one million, five hundred fifty thousand, sixty-one".

Divisors: 1 7 14285935723 100001550061