Base | Representation |
---|---|
bin | 10000110110000100101… |
… | …110100101010001101101 |
3 | 11002122220020211112012210 |
4 | 100312010232211101231 |
5 | 122431202142201240 |
6 | 2243440502521033 |
7 | 146426511131202 |
oct | 20660456452155 |
9 | 4078806745183 |
10 | 1157573006445 |
11 | 406a18869959 |
12 | 168418a36179 |
13 | 8520a7880ab |
14 | 400538b1ca9 |
15 | 201a00e9780 |
hex | 10d84ba546d |
1157573006445 has 8 divisors (see below), whose sum is σ = 1852116810336. Its totient is φ = 617372270096.
The previous prime is 1157573006437. The next prime is 1157573006459. The reversal of 1157573006445 is 5446003757511.
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 1157573006445 - 23 = 1157573006437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1157573006394 and 1157573006403.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38585766867 + ... + 38585766896.
It is an arithmetic number, because the mean of its divisors is an integer number (231514601292).
Almost surely, 21157573006445 is an apocalyptic number.
1157573006445 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1157573006445 is a deficient number, since it is larger than the sum of its proper divisors (694543803891).
1157573006445 is an equidigital number, since it uses as much as digits as its factorization.
1157573006445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77171533771.
The product of its (nonzero) digits is 1764000, while the sum is 48.
The spelling of 1157573006445 in words is "one trillion, one hundred fifty-seven billion, five hundred seventy-three million, six thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •