Search a number
-
+
101046027 = 333682009
BaseRepresentation
bin1100000010111…
…01011100001011
321001010200002110
412001131130023
5201331433102
614005433403
72334606555
oct601353413
9231120073
10101046027
1152046415
1229a0b863
1317c1b964
14d5c44d5
158d0e86c
hex605d70b

101046027 has 4 divisors (see below), whose sum is σ = 134728040. Its totient is φ = 67364016.

The previous prime is 101045953. The next prime is 101046041. The reversal of 101046027 is 720640101.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 101046027 - 211 = 101043979 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 101045994 and 101046012.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 2101046027 is an apocalyptic number.

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

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

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

The sum of its prime factors is 33682012.

The product of its (nonzero) digits is 336, while the sum is 21.

The square root of 101046027 is about 10052.1652891305. The cubic root of 101046027 is about 465.7716820096.

Adding to 101046027 its reverse (720640101), we get a palindrome (821686128).

The spelling of 101046027 in words is "one hundred one million, forty-six thousand, twenty-seven".

Divisors: 1 3 33682009 101046027