Nerdulator> put something in

Recognised as Number

36,308

  • Positive
  • Even
  • Composite
  • 5 digits

36,308 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value36,308
Digit count5
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 29 × 313
Distinct prime factors32, 29, 313
Number of divisors12
Sum of divisors σ(n)65,940
Aliquot sum29,632sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)17,472integers below n that share no factor with it
Carmichael function λ(n)2,184the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 17,472
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 29, 58, 116, 313, 626, 1,252, 9,077, 18,154, 36,30812 in total

Arithmetic

Previous number36,307
Next number36,309
Double72,616
Half18,154
Square root190.546582231≈irrational, shown to 9 decimal places
Cube root33.113171284≈
Negation-36,308
Reciprocal0.0000275421≈

Representations

Decimal36,308
Binary100011011101010016 bits
Octal106724
Hexadecimal8DD4
Base 36S0K
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-six thousand, three hundred and eight
Ordinalthirty-six thousand, three hundred and eighth
Scientific notation3.6308 × 10^4
Engineering notation36.308 × 10^3

In other bases

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

Bit-level

1000110111010100
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
Bytes28d d4
Gray code1100101100111110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1000110111010100
32-bit00000000000000001000110111010100
64-bit0000000000000000000000000000000000000000000000001000110111010100
One's complement0111001000101011at 16 bits, every bit flipped
Bits reversed0010101110110001at 16 bits
Rotated left by 10001101110101001at 16 bits, wrapping
Shifted left by 110001101110101000= 72,616, no wrap
Shifted right by 1100011011101010= 18,154, discarding the low bit
These bits as a double1.79385355 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime36,313+5
Previous prime36,307−1
Distance to nearest prime1
Nearest square below36,100
Nearest square above36,481

Powers & multiples

36,308 to the power 21,318,270,864
36,308 to the power 347,863,778,530,112
36,308 to the power 41,737,838,070,871,306,496
36,308 to the power 563,097,424,677,195,396,256,768
First ten multiples36,308, 72,616, 108,924, 145,232, 181,540, 217,848, 254,156, 290,464, 326,772, 363,080
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 167the total stopping time
Highest value reached36,308
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps36,308 → 18,154 → 9,077 → 27,232 → 13,616 → 6,808 → 3,404 → 1,702 → 851 → 2,554 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,630,800%
36,308% as a decimal363.08
36,308% of 10036,308
36,308% of 1,000363,080
As a fraction of 10036,308/100

Read another way

As bytes35.457 KiB
As a 24-bit colour#008DD4

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