Search a number
-
+
1156001656051 = 111013851270191
BaseRepresentation
bin10000110100100111000…
…100010110110011110011
311002111211202001122201001
4100310213010112303303
5122414442410443201
62243020531222431
7146342540643544
oct20644704266363
94074752048631
101156001656051
11406291886070
1216805a747a17
138501a073768
143dd44d184cb
152010c1a9301
hex10d27116cf3

1156001656051 has 16 divisors (see below), whose sum is σ = 1273914210816. Its totient is φ = 1040231500000.

The previous prime is 1156001655983. The next prime is 1156001656079. The reversal of 1156001656051 is 1506561006511.

It is not a de Polignac number, because 1156001656051 - 213 = 1156001647859 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4143366 + ... + 4413556.

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

Almost surely, 21156001656051 is an apocalyptic number.

1156001656051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

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

1156001656051 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 274154.

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

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

Divisors: 1 11 101 1111 3851 42361 270191 388951 2972101 4278461 27289291 300182201 1040505541 11445560951 105091059641 1156001656051