Search a number
-
+
1050151011 = 37133846707
BaseRepresentation
bin111110100110000…
…000100001100011
32201012001012100220
4332212000201203
54122314313021
6252112214123
735011064520
oct7646004143
92635035326
101050151011
11499867aa8
1225383a343
13139749240
149d684147
15622dacc6
hex3e980863

1050151011 has 16 divisors (see below), whose sum is σ = 1723325184. Its totient is φ = 553925664.

The previous prime is 1050151007. The next prime is 1050151073. The reversal of 1050151011 is 1101510501.

It is not a de Polignac number, because 1050151011 - 22 = 1050151007 is a prime.

It is a super-2 number, since 2×10501510112 = 2205634291808644242, which contains 22 as substring.

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

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

Almost surely, 21050151011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3846730.

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

The square root of 1050151011 is about 32406.0335585829. The cubic root of 1050151011 is about 1016.4450805205.

Adding to 1050151011 its reverse (1101510501), we get a palindrome (2151661512).

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

Divisors: 1 3 7 13 21 39 91 273 3846707 11540121 26926949 50007191 80780847 150021573 350050337 1050151011