Search a number
-
+
1113111051 = 31359483751
BaseRepresentation
bin100001001011000…
…1011101000001011
32212120111220022020
41002112023220023
54234424023201
6302241455523
736404200503
oct10226135013
92776456266
101113111051
1152135a898
122709415a3
131497c15c0
14a7b92a03
1567ac5a36
hex4258ba0b

1113111051 has 16 divisors (see below), whose sum is σ = 1625406720. Its totient is φ = 673380000.

The previous prime is 1113111019. The next prime is 1113111073. The reversal of 1113111051 is 1501113111.

It is not a de Polignac number, because 1113111051 - 25 = 1113111019 is a prime.

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

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

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

Almost surely, 21113111051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 483826.

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

The square root of 1113111051 is about 33363.3189446134. The cubic root of 1113111051 is about 1036.3652240015.

Adding to 1113111051 its reverse (1501113111), we get a palindrome (2614224162).

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

Divisors: 1 3 13 39 59 177 767 2301 483751 1451253 6288763 18866289 28541309 85623927 371037017 1113111051