Recognised as Number
93,522
- Positive
- Even
- Composite
- 5 digits
93,522 is an even 5-digit integer and a composite number. It has 32 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value93,522
Digit count5
Digit sum21
Digit product540
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 11 × 13 × 109
Distinct prime factors52, 3, 11, 13, 109
Number of divisors32
Sum of divisors σ(n)221,760
Aliquot sum128,238sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)25,920integers below n that share no factor with it
Carmichael function λ(n)540the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 25,920
Möbius function μ(n)−15 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 11, 13, 22, 26, 33, 39, 66, 78, 109, 143, 218, 286, 327, 429, 654, 858, 1,199, 1,417, 2,398, 2,834, 3,597, 4,251, 7,194, 8,502, 15,587, 31,174, 46,761, 93,52232 in total
Arithmetic
Representations
Decimal93,522
Binary1011011010101001017 bits
Octal266522
Hexadecimal16D52
Base 36205U
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-three thousand, five hundred and twenty-two
Ordinalninety-three thousand, five hundred and twenty-second
Scientific notation9.3522 × 10^4
Engineering notation93.522 × 10^3
In other bases
Ternary11202021210base 3; the most digit-efficient integer base after e: 11 digits
Quinary10443042base 5; one hand: 8 digits
Septenary536442base 7: 6 digits
Nonary152253base 9; each digit is two ternary digits: 6 digits
Duodecimal46156base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalbdg2base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal25:58:42base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TTT1T10TT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101011110101010110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010110110101010010
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 6d 52
Gray code11101101111111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010110110101010010
64-bit0000000000000000000000000000000000000000000000010110110101010010
One's complement11111111111111101001001010101101at 32 bits, every bit flipped
Bits reversed01001010101101101000000000000000at 32 bits
Rotated left by 100000000000000101101101010100100at 32 bits, wrapping
Shifted left by 1101101101010100100= 187,044, no wrap
Shifted right by 11011011010101001= 46,761, discarding the low bit
These bits as a double4.62060073 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
93,522 to the power 28,746,364,484
93,522 to the power 3817,977,499,272,648
93,522 to the power 476,498,891,686,976,586,256
93,522 to the power 57,154,329,348,349,424,299,833,632
First ten multiples93,522, 187,044, 280,566, 374,088, 467,610, 561,132, 654,654, 748,176, 841,698, 935,220
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8No, remainder 2
Divisible by 9No, remainder 3
Divisible by 10No, remainder 2
Divisible by 11Yes
Divisible by 12No, remainder 6
Divisible by 100No, remainder 22
Collatz (3n + 1) trajectory
Steps to reach 171the total stopping time
Highest value reached1,797,71219× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps93,522 → 46,761 → 140,284 → 70,142 → 35,071 → 105,214 → 52,607 → 157,822 → 78,911 → 236,734 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage9,352,200%
93,522% as a decimal935.22
93,522% of 10093,522
93,522% of 1,000935,220
As a fraction of 10093,522/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 93,522
Nerdulate something else
Nothing in mind? Surprise me · today’s page