Nerdulator> put something in

Recognised as Number

36,466

  • Positive
  • Even
  • Composite
  • 5 digits

36,466 is an even 5-digit integer and a composite number. It has 4 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value36,466
Digit count5
Digit sum25
Digit product2,592
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 18,233
Distinct prime factors22, 18,233
Number of divisors4
Sum of divisors σ(n)54,702
Aliquot sum18,236sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)18,232integers below n that share no factor with it
Carmichael function λ(n)18,232the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 18,233, 36,4664 in total

Arithmetic

Previous number36,465
Next number36,467
Double72,932
Half18,233
Square root190.960728947≈irrational, shown to 9 decimal places
Cube root33.161134178≈
Negation-36,466
Reciprocal0.0000274228≈

Representations

Decimal36,466
Binary100011100111001016 bits
Octal107162
Hexadecimal8E72
Base 36S4Y
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-six thousand, four hundred and sixty-six
Ordinalthirty-six thousand, four hundred and sixty-sixth
Scientific notation3.6466 × 10^4
Engineering notation36.466 × 10^3

In other bases

Ternary1212000121base 3; the most digit-efficient integer base after e: 10 digits
Quinary2131331base 5; one hand: 7 digits
Septenary211213base 7: 6 digits
Nonary55017base 9; each digit is two ternary digits: 5 digits
Duodecimal1912abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal4b36base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal10:7:46base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T0TT001TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001001110110110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1000111001110010
Bit length16 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits8within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes28e 72
Gray code1100100101001011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1000111001110010
32-bit00000000000000001000111001110010
64-bit0000000000000000000000000000000000000000000000001000111001110010
One's complement0111000110001101at 16 bits, every bit flipped
Bits reversed0100111001110001at 16 bits
Rotated left by 10001110011100101at 16 bits, wrapping
Shifted left by 110001110011100100= 72,932, no wrap
Shifted right by 1100011100111001= 18,233, discarding the low bit
These bits as a double1.80165978 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime36,467+1
Previous prime36,457−9
Distance to nearest prime1
Nearest square below36,100
Nearest square above36,481

Powers & multiples

36,466 to the power 21,329,769,156
36,466 to the power 348,491,362,042,696
36,466 to the power 41,768,286,008,248,952,336
36,466 to the power 564,482,317,576,806,295,884,576
First ten multiples36,466, 72,932, 109,398, 145,864, 182,330, 218,796, 255,262, 291,728, 328,194, 364,660
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1186the total stopping time
Highest value reached61,5401× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps36,466 → 18,233 → 54,700 → 27,350 → 13,675 → 41,026 → 20,513 → 61,540 → 30,770 → 15,385 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,646,600%
36,466% as a decimal364.66
36,466% of 10036,466
36,466% of 1,000364,660
As a fraction of 10036,466/100

Read another way

As bytes35.611 KiB
As a 24-bit colour#008E72

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 “36466” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.