Recognised as Number
75,642
- Positive
- Even
- Composite
- 5 digits
75,642 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value75,642
Digit count5
Digit sum24
Digit product1,680
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 7 × 1,801
Distinct prime factors42, 3, 7, 1,801
Number of divisors16
Sum of divisors σ(n)172,992
Aliquot sum97,350sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)21,600integers below n that share no factor with it
Carmichael function λ(n)1,800the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,600
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 7, 14, 21, 42, 1,801, 3,602, 5,403, 10,806, 12,607, 25,214, 37,821, 75,64216 in total
Arithmetic
Representations
Decimal75,642
Binary1001001110111101017 bits
Octal223572
Hexadecimal1277A
Base 361MD6
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-five thousand, six hundred and forty-two
Ordinalseventy-five thousand, six hundred and forty-second
Scientific notation7.5642 × 10^4
Engineering notation75.642 × 10^3
In other bases
Ternary10211202120base 3; the most digit-efficient integer base after e: 11 digits
Quinary4410032base 5; one hand: 7 digits
Septenary433350base 7: 6 digits
Nonary124676base 9; each digit is two ternary digits: 6 digits
Duodecimal37936base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal9922base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal21:0:42base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary110TTT10TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111100010001110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010010011101111010
Bit length17 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits7within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 27 7a
Gray code11011010011000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010010011101111010
64-bit0000000000000000000000000000000000000000000000010010011101111010
One's complement11111111111111101101100010000101at 32 bits, every bit flipped
Bits reversed01011110111001001000000000000000at 32 bits
Rotated left by 100000000000000100100111011110100at 32 bits, wrapping
Shifted left by 1100100111011110100= 151,284, no wrap
Shifted right by 11001001110111101= 37,821, discarding the low bit
These bits as a double3.73721136 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
75,642 to the power 25,721,712,164
75,642 to the power 3432,801,751,509,288
75,642 to the power 432,737,990,087,665,562,896
75,642 to the power 52,476,367,046,211,198,508,579,232
First ten multiples75,642, 151,284, 226,926, 302,568, 378,210, 453,852, 529,494, 605,136, 680,778, 756,420
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9No, remainder 6
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12No, remainder 6
Divisible by 100No, remainder 42
Collatz (3n + 1) trajectory
Steps to reach 1156the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps75,642 → 37,821 → 113,464 → 56,732 → 28,366 → 14,183 → 42,550 → 21,275 → 63,826 → 31,913 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,564,200%
75,642% as a decimal756.42
75,642% of 10075,642
75,642% of 1,000756,420
As a fraction of 10075,642/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,642
Nerdulate something else
Nothing in mind? Surprise me · today’s page