Nerdulator> put something in

Recognised as Number

84,027

  • Positive
  • Odd
  • Composite
  • 5 digits

84,027 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value84,027
Digit count5
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 37 × 757
Distinct prime factors33, 37, 757
Number of divisors8
Sum of divisors σ(n)115,216
Aliquot sum31,189sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)54,432integers below n that share no factor with it
Carmichael function λ(n)756the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 54,432
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 37, 111, 757, 2,271, 28,009, 84,0278 in total

Arithmetic

Previous number84,026
Next number84,028
Double168,054
Square root289.874110607≈irrational, shown to 9 decimal places
Cube root43.799883238≈
Negation-84,027
Reciprocal0.0000119009≈

Representations

Decimal84,027
Binary1010010000011101117 bits
Octal244073
Hexadecimal1483B
Base 361SU3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-four thousand and twenty-seven
Ordinaleighty-four thousand and twenty-seventh
Scientific notation8.4027 × 10^4
Engineering notation84.027 × 10^3

In other bases

Ternary11021021010base 3; the most digit-efficient integer base after e: 11 digits
Quinary10142102base 5; one hand: 8 digits
Septenary466656base 7: 6 digits
Nonary137233base 9; each digit is two ternary digits: 6 digits
Duodecimal40763base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalaa17base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal23:20:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary111T11T1010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101100001001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010100100000111011
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 48 3b
Gray code11110110000100110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010100100000111011
64-bit0000000000000000000000000000000000000000000000010100100000111011
One's complement11111111111111101011011111000100at 32 bits, every bit flipped
Bits reversed11011100000100101000000000000000at 32 bits
Rotated left by 100000000000000101001000001110110at 32 bits, wrapping
Shifted left by 1101001000001110110= 168,054, no wrap
Shifted right by 11010010000011101= 42,013, discarding the low bit
These bits as a double4.1514854 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime84,047+20
Previous prime84,017−10
Distance to nearest prime10
Nearest square below83,521
Nearest square above84,100

Powers & multiples

84,027 to the power 27,060,536,729
84,027 to the power 3593,275,719,727,683
84,027 to the power 449,851,178,901,558,019,441
84,027 to the power 54,188,845,009,561,215,699,568,907
First ten multiples84,027, 168,054, 252,081, 336,108, 420,135, 504,162, 588,189, 672,216, 756,243, 840,270
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 3
Divisible by 100No, remainder 27

Collatz (3n + 1) trajectory

Steps to reach 189the total stopping time
Highest value reached425,3925× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps84,027 → 252,082 → 126,041 → 378,124 → 189,062 → 94,531 → 283,594 → 141,797 → 425,392 → 212,696 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage8,402,700%
84,027% as a decimal840.27
84,027% of 10084,027
84,027% of 1,000840,270
As a fraction of 10084,027/100

Read another way

As bytes82.058 KiB
As a 24-bit colour#01483B

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “84027” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.