Search a number
-
+
1150505605051 = 11359291340999
BaseRepresentation
bin10000101111011111011…
…110100101011110111011
311001222122201021100002121
4100233133132211132323
5122322213413330201
62240311315542111
7146056413200335
oct20573736453673
94058581240077
101150505605051
11403a21469660
12166b85bba937
138465251338a
143d98300c455
151edd99199a1
hex10bdf7a57bb

1150505605051 has 8 divisors (see below), whose sum is σ = 1258593120000. Its totient is φ = 1043000772840.

The previous prime is 1150505605009. The next prime is 1150505605061. The reversal of 1150505605051 is 1505065050511.

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 1150505605051 - 219 = 1150505080763 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 21150505605051 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 291341369.

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

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

Divisors: 1 11 359 3949 291340999 3204750989 104591418641 1150505605051