Recognised as Number
75,473
- Positive
- Odd
- Composite
- 5 digits
75,473 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value75,473
Digit count5
Digit sum26
Digit product2,940
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation71 × 1,063
Distinct prime factors271, 1,063
Number of divisors4
Sum of divisors σ(n)76,608
Aliquot sum1,135sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)74,340integers below n that share no factor with it
Carmichael function λ(n)37,170the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 74,340
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 71, 1,063, 75,4734 in total
Arithmetic
Representations
Decimal75,473
Binary1001001101101000117 bits
Octal223321
Hexadecimal126D1
Base 361M8H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-five thousand, four hundred and seventy-three
Ordinalseventy-five thousand, four hundred and seventy-third
Scientific notation7.5473 × 10^4
Engineering notation75.473 × 10^3
In other bases
Ternary10211112022base 3; the most digit-efficient integer base after e: 11 digits
Quinary4403343base 5; one hand: 7 digits
Septenary433016base 7: 6 digits
Nonary124468base 9; each digit is two ternary digits: 6 digits
Duodecimal37815base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal98ddbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal20:57:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary110TTTTT10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111101111010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010010011011010001
Bit length17 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits9within that length
Bit parityeven8 set bits, so even; 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 26 d1
Gray code11011010110111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010010011011010001
64-bit0000000000000000000000000000000000000000000000010010011011010001
One's complement11111111111111101101100100101110at 32 bits, every bit flipped
Bits reversed10001011011001001000000000000000at 32 bits
Rotated left by 100000000000000100100110110100010at 32 bits, wrapping
Shifted left by 1100100110110100010= 150,946, no wrap
Shifted right by 11001001101101000= 37,736, discarding the low bit
These bits as a double3.72886165 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
75,473 to the power 25,696,173,729
75,473 to the power 3429,907,319,848,817
75,473 to the power 432,446,395,150,949,765,441
75,473 to the power 52,448,826,781,227,631,647,128,593
First ten multiples75,473, 150,946, 226,419, 301,892, 377,365, 452,838, 528,311, 603,784, 679,257, 754,730
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1112the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps75,473 → 226,420 → 113,210 → 56,605 → 169,816 → 84,908 → 42,454 → 21,227 → 63,682 → 31,841 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,547,300%
75,473% as a decimal754.73
75,473% of 10075,473
75,473% of 1,000754,730
As a fraction of 10075,473/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 75,473
Nerdulate something else
Nothing in mind? Surprise me · today’s page