Search a number
-
+
101106051 = 3149922483
BaseRepresentation
bin1100000011011…
…00000110000011
321001020201102120
412001230012003
5201340343201
614011015323
72335246554
oct601540603
9231221376
10101106051
1152087522
1229a3a543
1317c40087
14d5dc32b
158d22536
hex606c183

101106051 has 8 divisors (see below), whose sum is σ = 134904000. Its totient is φ = 67356072.

The previous prime is 101106023. The next prime is 101106053. The reversal of 101106051 is 150601101.

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

It is not a de Polignac number, because 101106051 - 210 = 101105027 is a prime.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6745 + ... + 15738.

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

Almost surely, 2101106051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 23985.

The product of its (nonzero) digits is 30, while the sum is 15.

The square root of 101106051 is about 10055.1504712759. The cubic root of 101106051 is about 465.8638906339.

Adding to 101106051 its reverse (150601101), we get a palindrome (251707152).

It can be divided in two parts, 10110 and 6051, that added together give a palindrome (16161).

The spelling of 101106051 in words is "one hundred one million, one hundred six thousand, fifty-one".

Divisors: 1 3 1499 4497 22483 67449 33702017 101106051