Base | Representation |
---|---|
bin | 10000110101111001010… |
… | …010010001101001001101 |
3 | 11002122101212121110010022 |
4 | 100311321102101221031 |
5 | 122430304021132441 |
6 | 2243405444151525 |
7 | 146421660330335 |
oct | 20657122215115 |
9 | 4078355543108 |
10 | 1157381036621 |
11 | 40692a471107 |
12 | 1683846985a5 |
13 | 851a9a82b94 |
14 | 400361c00c5 |
15 | 2018d32984b |
hex | 10d79491a4d |
1157381036621 has 2 divisors, whose sum is σ = 1157381036622. Its totient is φ = 1157381036620.
The previous prime is 1157381036563. The next prime is 1157381036641. The reversal of 1157381036621 is 1266301837511.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1153344975721 + 4036060900 = 1073939^2 + 63530^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1157381036621 is a prime.
It is a super-3 number, since 3×11573810366213 (a number of 37 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1157381036641) by changing a digit.
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 as a sum of consecutive naturals, namely, 578690518310 + 578690518311.
It is an arithmetic number, because the mean of its divisors is an integer number (578690518311).
Almost surely, 21157381036621 is an apocalyptic number.
It is an amenable number.
1157381036621 is a deficient number, since it is larger than the sum of its proper divisors (1).
1157381036621 is an equidigital number, since it uses as much as digits as its factorization.
1157381036621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 181440, while the sum is 44.
The spelling of 1157381036621 in words is "one trillion, one hundred fifty-seven billion, three hundred eighty-one million, thirty-six thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •