Search a number
-
+
1096091000051 = 23383617201667
BaseRepresentation
bin11111111001101000001…
…11010101110011110011
310212210012110120222212212
433330310013111303303
5120424243244000201
62155312014042335
7142122104530145
oct17746407256363
93783173528785
101096091000051
11392938881523
1215851a7a93ab
137c48cc98a58
143b0a0280c95
151d7a2703abb
hexff341d5cf3

1096091000051 has 16 divisors (see below), whose sum is σ = 1148597673984. Its totient is φ = 1043997455424.

The previous prime is 1096091000041. The next prime is 1096091000063. The reversal of 1096091000051 is 1500001906901.

It is a happy number.

It is a cyclic number.

It is not a de Polignac number, because 1096091000051 - 214 = 1096090983667 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 1096090999981 and 1096091000017.

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

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

Almost surely, 21096091000051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 202690.

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

Adding to 1096091000051 its reverse (1500001906901), we get a palindrome (2596092906952).

The spelling of 1096091000051 in words is "one trillion, ninety-six billion, ninety-one million, fifty-one", and thus it is an aban number and an uban number.

Divisors: 1 23 383 617 8809 14191 201667 236311 4638341 5435153 77238461 124428539 1776484603 2861856397 47656130437 1096091000051