Recognised as Number
36,855
- Positive
- Odd
- Composite
- 5 digits
36,855 is an odd 5-digit integer and a composite number. It has 40 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value36,855
Digit count5
Digit sum27
Digit product3,600
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3^4 × 5 × 7 × 13
Distinct prime factors43, 5, 7, 13
Number of divisors40
Sum of divisors σ(n)81,312
Aliquot sum44,457sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)15,552integers below n that share no factor with it
Carmichael function λ(n)108the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 15,552
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 7, 9, 13, 15, 21, 27, 35, 39, 45, 63, 65, 81, 91, 105, 117, 135, 189, 195, 273, 315, 351, 405, 455, 567, 585, 819, 945, 1,053, 1,365, 1,755, 2,457, 2,835, 4,095, 5,265, 7,371, 12,285, 36,85540 in total
Arithmetic
Representations
Decimal36,855
Binary100011111111011116 bits
Octal107767
Hexadecimal8FF7
Base 36SFR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-six thousand, eight hundred and fifty-five
Ordinalthirty-six thousand, eight hundred and fifty-fifth
Scientific notation3.6855 × 10^4
Engineering notation36.855 × 10^3
In other bases
Ternary1212120000base 3; the most digit-efficient integer base after e: 10 digits
Quinary2134410base 5; one hand: 7 digits
Septenary212310base 7: 6 digits
Nonary55500base 9; each digit is two ternary digits: 5 digits
Duodecimal193b3base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal4c2fbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal10:14:15base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T0T0TT0000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001000000001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000111111110111
Bit length16 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits4within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes28f f7
Gray code1100100000001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000111111110111
32-bit00000000000000001000111111110111
64-bit0000000000000000000000000000000000000000000000001000111111110111
One's complement0111000000001000at 16 bits, every bit flipped
Bits reversed1110111111110001at 16 bits
Rotated left by 10001111111101111at 16 bits, wrapping
Shifted left by 110001111111101110= 73,710, no wrap
Shifted right by 1100011111111011= 18,427, discarding the low bit
These bits as a double1.82087894 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
36,855 to the power 21,358,291,025
36,855 to the power 350,059,815,726,375
36,855 to the power 41,844,954,508,595,550,625
36,855 to the power 567,995,798,414,289,018,284,375
First ten multiples36,855, 73,710, 110,565, 147,420, 184,275, 221,130, 257,985, 294,840, 331,695, 368,550
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 5
Divisible by 11No, remainder 5
Divisible by 12No, remainder 3
Divisible by 100No, remainder 55
Collatz (3n + 1) trajectory
Steps to reach 1168the total stopping time
Highest value reached1,702,27646× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps36,855 → 110,566 → 55,283 → 165,850 → 82,925 → 248,776 → 124,388 → 62,194 → 31,097 → 93,292 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage3,685,500%
36,855% as a decimal368.55
36,855% of 10036,855
36,855% of 1,000368,550
As a fraction of 10036,855/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 36,855
Nerdulate something else
Nothing in mind? Surprise me · today’s page