Recognised as Number
74,471
- Positive
- Odd
- Prime
- 5 digits
74,471 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value74,471
Digit count5
Digit sum23
Digit product784
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation74,471
Distinct prime factors174,471
Number of divisors2
Sum of divisors σ(n)74,472
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)74,470integers below n that share no factor with it
Carmichael function λ(n)74,470the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 74,4712 in total
Arithmetic
Representations
Decimal74,471
Binary1001000101110011117 bits
Octal221347
Hexadecimal122E7
Base 361LGN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-four thousand, four hundred and seventy-one
Ordinalseventy-four thousand, four hundred and seventy-first
Scientific notation7.4471 × 10^4
Engineering notation74.471 × 10^3
In other bases
Ternary10210011012base 3; the most digit-efficient integer base after e: 11 digits
Quinary4340341base 5; one hand: 7 digits
Septenary430055base 7: 6 digits
Nonary123135base 9; each digit is two ternary digits: 6 digits
Duodecimal3711bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal963bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal20:41:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T100111TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110011100111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010010001011100111
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 22 e7
Gray code11011001110010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010010001011100111
64-bit0000000000000000000000000000000000000000000000010010001011100111
One's complement11111111111111101101110100011000at 32 bits, every bit flipped
Bits reversed11100111010001001000000000000000at 32 bits
Rotated left by 100000000000000100100010111001110at 32 bits, wrapping
Shifted left by 1100100010111001110= 148,942, no wrap
Shifted right by 11001000101110011= 37,235, discarding the low bit
These bits as a double3.67935627 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
74,471 to the power 25,545,929,841
74,471 to the power 3413,010,941,189,111
74,471 to the power 430,757,337,801,294,285,281
74,471 to the power 52,290,529,703,400,186,719,161,351
First ten multiples74,471, 148,942, 223,413, 297,884, 372,355, 446,826, 521,297, 595,768, 670,239, 744,710
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1187the total stopping time
Highest value reached6,114,58082× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps74,471 → 223,414 → 111,707 → 335,122 → 167,561 → 502,684 → 251,342 → 125,671 → 377,014 → 188,507 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,447,100%
74,471% as a decimal744.71
74,471% of 10074,471
74,471% of 1,000744,710
As a fraction of 10074,471/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 74,471
Nerdulate something else
Nothing in mind? Surprise me · today’s page