[go: up one dir, main page]

Search a number
-
+
1106051051 = 7457345749
BaseRepresentation
bin100000111101100…
…1111111111101011
32212002020012210202
41001323033333223
54231122113201
6301430302415
736260164430
oct10173177753
92762205722
101106051051
11518378586
1226a4b7a0b
131481bbca1
14a6c75b87
156717dc6b
hex41ecffeb

1106051051 has 8 divisors (see below), whose sum is σ = 1266828000. Its totient is φ = 945966528.

The previous prime is 1106050997. The next prime is 1106051057. The reversal of 1106051051 is 1501506011.

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 1106051051 - 26 = 1106050987 is a prime.

It is a Duffinian number.

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

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

Almost surely, 21106051051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 346213.

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

The square root of 1106051051 is about 33257.3458201342. The cubic root of 1106051051 is about 1034.1694975216.

Adding to 1106051051 its reverse (1501506011), we get a palindrome (2607557062).

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

Divisors: 1 7 457 3199 345749 2420243 158007293 1106051051