Recognised as Number
84,025
- Positive
- Odd
- Composite
- 5 digits
84,025 is an odd 5-digit integer and a composite number. It has 6 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value84,025
Digit count5
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5^2 × 3,361
Distinct prime factors25, 3,361
Number of divisors6
Sum of divisors σ(n)104,222
Aliquot sum20,197sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)67,200integers below n that share no factor with it
Carmichael function λ(n)3,360the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 67,200
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 5, 25, 3,361, 16,805, 84,0256 in total
Arithmetic
Representations
Decimal84,025
Binary1010010000011100117 bits
Octal244071
Hexadecimal14839
Base 361SU1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-four thousand and twenty-five
Ordinaleighty-four thousand and twenty-fifth
Scientific notation8.4025 × 10^4
Engineering notation84.025 × 10^3
In other bases
Ternary11021021001base 3; the most digit-efficient integer base after e: 11 digits
Quinary10142100base 5; one hand: 8 digits
Septenary466654base 7: 6 digits
Nonary137231base 9; each digit is two ternary digits: 6 digits
Duodecimal40761base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalaa15base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal23:20:25base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary111T11T1001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101100001001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010100100000111001
Bit length17 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits10within that length
Bit parityodd7 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 48 39
Gray code11110110000100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010100100000111001
64-bit0000000000000000000000000000000000000000000000010100100000111001
One's complement11111111111111101011011111000110at 32 bits, every bit flipped
Bits reversed10011100000100101000000000000000at 32 bits
Rotated left by 100000000000000101001000001110010at 32 bits, wrapping
Shifted left by 1101001000001110010= 168,050, no wrap
Shifted right by 11010010000011100= 42,012, discarding the low bit
These bits as a double4.15138659 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
84,025 to the power 27,060,200,625
84,025 to the power 3593,233,357,515,625
84,025 to the power 449,846,432,865,250,390,625
84,025 to the power 54,188,346,521,502,664,072,265,625
First ten multiples84,025, 168,050, 252,075, 336,100, 420,125, 504,150, 588,175, 672,200, 756,225, 840,250
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 5
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 25
Collatz (3n + 1) trajectory
Steps to reach 1133the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps84,025 → 252,076 → 126,038 → 63,019 → 189,058 → 94,529 → 283,588 → 141,794 → 70,897 → 212,692 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,402,500%
84,025% as a decimal840.25
84,025% of 10084,025
84,025% of 1,000840,250
As a fraction of 10084,025/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 84,025
Nerdulate something else
Nothing in mind? Surprise me · today’s page