Base | Representation |
---|---|
bin | 1000111011000… |
… | …11101000000001 |
3 | 12012212010110001 |
4 | 10131203220001 |
5 | 123130410321 |
6 | 11232240001 |
7 | 1566162604 |
oct | 435435001 |
9 | 165763401 |
10 | 74856961 |
11 | 39289163 |
12 | 210a0001 |
13 | 1267c47a |
14 | 9d2833b |
15 | 6889c91 |
hex | 4763a01 |
74856961 has 2 divisors, whose sum is σ = 74856962. Its totient is φ = 74856960.
The previous prime is 74856959. The next prime is 74857007. The reversal of 74856961 is 16965847.
It is an a-pointer prime, because the next prime (74857007) can be obtained adding 74856961 to its sum of digits (46).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 48385936 + 26471025 = 6956^2 + 5145^2 .
It is a cyclic number.
It is not a de Polignac number, because 74856961 - 21 = 74856959 is a prime.
It is a super-2 number, since 2×748569612 = 11207129220311042, which contains 22 as substring.
Together with 74856959, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (74856931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 37428480 + 37428481.
It is an arithmetic number, because the mean of its divisors is an integer number (37428481).
Almost surely, 274856961 is an apocalyptic number.
It is an amenable number.
74856961 is a deficient number, since it is larger than the sum of its proper divisors (1).
74856961 is an equidigital number, since it uses as much as digits as its factorization.
74856961 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 362880, while the sum is 46.
The square root of 74856961 is about 8651.9917360108. The cubic root of 74856961 is about 421.4480647773.
The spelling of 74856961 in words is "seventy-four million, eight hundred fifty-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •