Recognised as Number
76,492
- Positive
- Even
- Composite
- 5 digits
76,492 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value76,492
Digit count5
Digit sum28
Digit product3,024
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 13 × 1,471
Distinct prime factors32, 13, 1,471
Number of divisors12
Sum of divisors σ(n)144,256
Aliquot sum67,764sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)35,280integers below n that share no factor with it
Carmichael function λ(n)2,940the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 35,280
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 13, 26, 52, 1,471, 2,942, 5,884, 19,123, 38,246, 76,49212 in total
Arithmetic
Representations
Decimal76,492
Binary1001010101100110017 bits
Octal225314
Hexadecimal12ACC
Base 361N0S
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-six thousand, four hundred and ninety-two
Ordinalseventy-six thousand, four hundred and ninety-second
Scientific notation7.6492 × 10^4
Engineering notation76.492 × 10^3
In other bases
Ternary10212221001base 3; the most digit-efficient integer base after e: 11 digits
Quinary4421432base 5; one hand: 7 digits
Septenary436003base 7: 6 digits
Nonary125831base 9; each digit is two ternary digits: 6 digits
Duodecimal38324base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal9b4cbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal21:14:52base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary110T00T1001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111111111011100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010010101011001100
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 even
Highest set bitbit 16worth 65,536
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes301 2a cc
Gray code11011111110101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010010101011001100
64-bit0000000000000000000000000000000000000000000000010010101011001100
One's complement11111111111111101101010100110011at 32 bits, every bit flipped
Bits reversed00110011010101001000000000000000at 32 bits
Rotated left by 100000000000000100101010110011000at 32 bits, wrapping
Shifted left by 1100101010110011000= 152,984, no wrap
Shifted right by 11001010101100110= 38,246, discarding the low bit
These bits as a double3.77920694 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
76,492 to the power 25,851,026,064
76,492 to the power 3447,556,685,687,488
76,492 to the power 434,234,506,001,607,332,096
76,492 to the power 52,618,665,833,074,948,046,687,232
First ten multiples76,492, 152,984, 229,476, 305,968, 382,460, 458,952, 535,444, 611,936, 688,428, 764,920
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 4
Divisible by 9No, remainder 1
Divisible by 10No, remainder 2
Divisible by 11No, remainder 9
Divisible by 12No, remainder 4
Divisible by 100No, remainder 92
Collatz (3n + 1) trajectory
Steps to reach 181the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps76,492 → 38,246 → 19,123 → 57,370 → 28,685 → 86,056 → 43,028 → 21,514 → 10,757 → 32,272 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,649,200%
76,492% as a decimal764.92
76,492% of 10076,492
76,492% of 1,000764,920
As a fraction of 10076,492/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 76,492
Nerdulate something else
Nothing in mind? Surprise me · today’s page