Search a number
-
+
1101311051 = 17591098017
BaseRepresentation
bin100000110100100…
…1010110001001011
32211202022101202012
41001221022301023
54223413423201
6301140530135
736201663251
oct10151126113
92752271665
101101311051
11515730325
122689b094b
1314721c659
14a63a05d1
1566a445bb
hex41a4ac4b

1101311051 has 8 divisors (see below), whose sum is σ = 1185859440. Its totient is φ = 1018958848.

The previous prime is 1101311027. The next prime is 1101311083. The reversal of 1101311051 is 1501131011.

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

It is a cyclic number.

It is not a de Polignac number, because 1101311051 - 210 = 1101310027 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (1101311251) 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 7 ways as a sum of consecutive naturals, for example, 548006 + ... + 550011.

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

Almost surely, 21101311051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1098093.

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

The square root of 1101311051 is about 33186.0068552997. The cubic root of 1101311051 is about 1032.6900653214.

Adding to 1101311051 its reverse (1501131011), we get a palindrome (2602442062).

The spelling of 1101311051 in words is "one billion, one hundred one million, three hundred eleven thousand, fifty-one".

Divisors: 1 17 59 1003 1098017 18666289 64783003 1101311051