Recognised as Number

36,460

Positive
Even
Composite
5 digits

36,460 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 value36,460

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 factorisation2^2 × 5 × 1,823

Distinct prime factors32, 5, 1,823

Number of divisors12

Sum of divisors σ(n)76,608

Aliquot sum40,148sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)14,576integers below n that share no factor with it

Carmichael function λ(n)3,644the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 14,576

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 5, 10, 20, 1,823, 3,646, 7,292, 9,115, 18,230, 36,46012 in total

Arithmetic

Previous number36,459

Next number36,461

Double72,920

Half18,230

Square1,329,331,600

Cube48,467,430,136,000

Square root190.945018264≈irrational, shown to 9 decimal places

Cube root33.159315335≈

Negation-36,460

Reciprocal0.0000274273≈

Representations

Decimal36,460

Binary100011100110110016 bits

Octal107154

Hexadecimal8E6C

Base 36S4S

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsthirty-six thousand, four hundred and sixty

Ordinalthirty-six thousand, four hundred and sixtieth

Scientific notation3.646 × 10^4

Engineering notation36.46 × 10^3

In other bases

Ternary1212000101base 3; the most digit-efficient integer base after e: 10 digits

Quinary2131320base 5; one hand: 7 digits

Septenary211204base 7: 6 digits

Nonary55011base 9; each digit is two ternary digits: 5 digits

Duodecimal19124base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal4b30base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal10:7:40base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1T0TT000101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11001001110111100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1000111001101100

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 22 trailing zeros

Power of twoNo

Bytes28e 6c

Gray code1100100101011010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1000111001101100

32-bit00000000000000001000111001101100

64-bit0000000000000000000000000000000000000000000000001000111001101100

One's complement0111000110010011at 16 bits, every bit flipped

Bits reversed0011011001110001at 16 bits

Rotated left by 10001110011011001at 16 bits, wrapping

Shifted left by 110001110011011000= 72,920, no wrap

Shifted right by 1100011100110110= 18,230, discarding the low bit

These bits as a double1.80136334 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime36,467+7

Previous prime36,457−3

Distance to nearest prime3

Nearest square below36,100

Nearest square above36,481

Powers & multiples

36,460 to the power 21,329,331,600

36,460 to the power 348,467,430,136,000

36,460 to the power 41,767,122,502,758,560,000

36,460 to the power 564,429,286,450,577,097,600,000

First ten multiples36,460, 72,920, 109,380, 145,840, 182,300, 218,760, 255,220, 291,680, 328,140, 364,600

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5Yes

Divisible by 6No, remainder 4

Divisible by 7No, remainder 4

Divisible by 8No, remainder 4

Divisible by 9No, remainder 1

Divisible by 10Yes

Divisible by 11No, remainder 6

Divisible by 12No, remainder 4

Divisible by 100No, remainder 60

Collatz (3n + 1) trajectory

Steps to reach 1155the total stopping time

Highest value reached103,8402× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps36,460 → 18,230 → 9,115 → 27,346 → 13,673 → 41,020 → 20,510 → 10,255 → 30,766 → 15,383 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,646,000%

36,460% as a decimal364.6

36,460% of 10036,460

36,460% of 1,000364,600

As a fraction of 10036,460/100

Read another way

As seconds10 hours, 7 minutes and 40 seconds

As bytes35.605 KiB

As a 24-bit colour#008E6C

Keep nerding

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