Search a number
-
+
1158009151099 = 1913605336723
BaseRepresentation
bin10000110110011110101…
…110010101111001111011
311002201000122111222012111
4100312132232111321323
5122433100320313344
62243552042553151
7146443355243023
oct20663656257173
94081018458174
101158009151099
11407121a81889
1216851ab087b7
1385279c43458
14400957a4a83
15201c854c834
hex10d9eb95e7b

1158009151099 has 4 divisors (see below), whose sum is σ = 1158614489736. Its totient is φ = 1157403812464.

The previous prime is 1158009151067. The next prime is 1158009151109. The reversal of 1158009151099 is 9901519008511.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 1158009151099 - 25 = 1158009151067 is a prime.

It is a super-2 number, since 2×11580091510992 (a number of 25 digits) contains 22 as substring.

It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.

It is a Duffinian number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 302666449 + ... + 302670274.

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

Almost surely, 21158009151099 is an apocalyptic number.

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

1158009151099 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 605338636.

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

The spelling of 1158009151099 in words is "one trillion, one hundred fifty-eight billion, nine million, one hundred fifty-one thousand, ninety-nine".

Divisors: 1 1913 605336723 1158009151099