Recognised as Number

36,490

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value36,490

Digit count5

Digit sum22

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 41 × 89

Distinct prime factors42, 5, 41, 89

Number of divisors16

Sum of divisors σ(n)68,040

Aliquot sum31,550sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 41, 82, 89, 178, 205, 410, 445, 890, 3,649, 7,298, 18,245, 36,49016 in total

Arithmetic

Previous number36,489

Next number36,491

Double72,980

Half18,245

Square1,331,520,100

Cube48,587,168,449,000

Square root191.023558757≈irrational, shown to 9 decimal places

Cube root33.168407553≈

Negation-36,490

Reciprocal0.0000274048≈

Representations

Decimal36,490

Binary100011101000101016 bits

Octal107212

Hexadecimal8E8A

Base 36S5M

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

In wordsthirty-six thousand, four hundred and ninety

Ordinalthirty-six thousand, four hundred and ninetieth

Scientific notation3.649 × 10^4

Engineering notation36.49 × 10^3

In other bases

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

Quinary2131430base 5; one hand: 7 digits

Septenary211246base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000111010001010

Bit length16 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits9within that length

Bit parityodd7 set bits, so odd; 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 8a

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

At each machine width

16-bit1000111010001010

32-bit00000000000000001000111010001010

64-bit0000000000000000000000000000000000000000000000001000111010001010

One's complement0111000101110101at 16 bits, every bit flipped

Bits reversed0101000101110001at 16 bits

Rotated left by 10001110100010101at 16 bits, wrapping

Shifted left by 110001110100010100= 72,980, no wrap

Shifted right by 1100011101000101= 18,245, discarding the low bit

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

Nearest landmarks

Next prime36,493+3

Previous prime36,479−11

Distance to nearest prime3

Nearest square below36,481

Nearest square above36,864

Powers & multiples

36,490 to the power 21,331,520,100

36,490 to the power 348,587,168,449,000

36,490 to the power 41,772,945,776,704,010,000

36,490 to the power 564,694,791,391,929,324,900,000

First ten multiples36,490, 72,980, 109,470, 145,960, 182,450, 218,940, 255,430, 291,920, 328,410, 364,900

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 5Yes

Divisible by 6No, remainder 4

Divisible by 7No, remainder 6

Divisible by 8No, remainder 2

Divisible by 9No, remainder 4

Divisible by 10Yes

Divisible by 11No, remainder 3

Divisible by 12No, remainder 10

Divisible by 100No, remainder 90

Collatz (3n + 1) trajectory

Steps to reach 162the total stopping time

Highest value reached54,7361× the starting value

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

First steps36,490 → 18,245 → 54,736 → 27,368 → 13,684 → 6,842 → 3,421 → 10,264 → 5,132 → 2,566 → …

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

As a percentage & fraction

As a percentage3,649,000%

36,490% as a decimal364.9

36,490% of 10036,490

36,490% of 1,000364,900

As a fraction of 10036,490/100

Read another way

As seconds10 hours, 8 minutes and 10 seconds

As bytes35.635 KiB

As a 24-bit colour#008E8A

Keep nerding

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