Base | Representation |
---|---|
bin | 10000111111010011100100… |
… | …010100111000011001111101 |
3 | 100210120002000021111201202122 |
4 | 100333103210110320121331 |
5 | 34243144134412313011 |
6 | 422525250003132325 |
7 | 21511163333533142 |
oct | 2077234424703175 |
9 | 323502007451678 |
10 | 74719081760381 |
11 | 21898203805393 |
12 | 84690853740a5 |
13 | 328cc96335536 |
14 | 14645cc4483c9 |
15 | 898934d933db |
hex | 43f4e453867d |
74719081760381 has 2 divisors, whose sum is σ = 74719081760382. Its totient is φ = 74719081760380.
The previous prime is 74719081760371. The next prime is 74719081760413. The reversal of 74719081760381 is 18306718091747.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 49717531736356 + 25001550024025 = 7051066^2 + 5000155^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-74719081760381 is a prime.
It is a super-3 number, since 3×747190817603813 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (74719081760371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 37359540880190 + 37359540880191.
It is an arithmetic number, because the mean of its divisors is an integer number (37359540880191).
Almost surely, 274719081760381 is an apocalyptic number.
It is an amenable number.
74719081760381 is a deficient number, since it is larger than the sum of its proper divisors (1).
74719081760381 is an equidigital number, since it uses as much as digits as its factorization.
74719081760381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14224896, while the sum is 62.
The spelling of 74719081760381 in words is "seventy-four trillion, seven hundred nineteen billion, eighty-one million, seven hundred sixty thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •