Recognised as Number

91,101

Positive
Odd
Composite
5 digits

91,101 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value91,101

Digit count5

Digit sum12

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation3 × 30,367

Distinct prime factors23, 30,367

Number of divisors4

Sum of divisors σ(n)121,472

Aliquot sum30,371sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)30,366the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 60,732

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 30,367, 91,1014 in total

Arithmetic

Previous number91,100

Next number91,102

Double182,202

Half45,550.5

Square8,299,392,201

Cube756,082,928,903,301

Square root301.829422025≈irrational, shown to 9 decimal places

Cube root44.996049036≈

Negation-91,101

Reciprocal0.0000109768≈

Representations

Decimal91,101

Binary1011000111101110117 bits

Octal261735

Hexadecimal163DD

Base 361YAL

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

In wordsninety-one thousand, one hundred and one

Ordinalninety-one thousand, one hundred and first

Scientific notation9.1101 × 10^4

Engineering notation91.101 × 10^3

In other bases

Ternary11121222010base 3; the most digit-efficient integer base after e: 11 digits

Quinary10403401base 5; one hand: 8 digits

Septenary526413base 7: 6 digits

Nonary147863base 9; each digit is two ternary digits: 6 digits

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

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

Sexagesimal25:18:21base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

00000000000000010110001111011101

Bit length17 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits6within that length

Bit parityodd11 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 16worth 65,536

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes301 63 dd

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

At each machine width

32-bit00000000000000010110001111011101

64-bit0000000000000000000000000000000000000000000000010110001111011101

One's complement11111111111111101001110000100010at 32 bits, every bit flipped

Bits reversed10111011110001101000000000000000at 32 bits

Rotated left by 100000000000000101100011110111010at 32 bits, wrapping

Shifted left by 1101100011110111010= 182,202, no wrap

Shifted right by 11011000111101110= 45,550, discarding the low bit

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

Nearest landmarks

Next prime91,121+20

Previous prime91,099−2

Distance to nearest prime2

Nearest square below90,601

Nearest square above91,204

Powers & multiples

91,101 to the power 28,299,392,201

91,101 to the power 3756,082,928,903,301

91,101 to the power 468,879,910,906,019,624,401

91,101 to the power 56,275,028,763,449,293,802,555,501

First ten multiples91,101, 182,202, 273,303, 364,404, 455,505, 546,606, 637,707, 728,808, 819,909, 911,010

Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 3

Divisible by 10No, remainder 1

Divisible by 11No, remainder 10

Divisible by 12No, remainder 9

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1177the total stopping time

Highest value reached273,3043× the starting value

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

First steps91,101 → 273,304 → 136,652 → 68,326 → 34,163 → 102,490 → 51,245 → 153,736 → 76,868 → 38,434 → …

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

As a percentage & fraction

As a percentage9,110,100%

91,101% as a decimal911.01

91,101% of 10091,101

91,101% of 1,000911,010

As a fraction of 10091,101/100

Read another way

As seconds1 day, 1 hour and 18 minutes

As bytes88.966 KiB

As a 24-bit colour#0163DD

Keep nerding

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