Recognised as Number

91,099

Positive
Odd
Prime
5 digits

91,099 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value91,099

Digit count5

Digit sum28

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation91,099

Distinct prime factors191,099

Number of divisors2

Sum of divisors σ(n)91,100

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)91,098the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 91,0992 in total

Arithmetic

Previous number91,098

Next number91,100

Double182,198

Half45,549.5

Square8,299,027,801

Cube756,033,133,643,299

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

Cube root44.995719758≈

Negation-91,099

Reciprocal0.0000109771≈

Representations

Decimal91,099

Binary1011000111101101117 bits

Octal261733

Hexadecimal163DB

Base 361YAJ

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

In wordsninety-one thousand and ninety-nine

Ordinalninety-one thousand and ninety-ninth

Scientific notation9.1099 × 10^4

Engineering notation91.099 × 10^3

In other bases

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

Quinary10403344base 5; one hand: 8 digits

Septenary526411base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010110001111011011

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 db

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

At each machine width

32-bit00000000000000010110001111011011

64-bit0000000000000000000000000000000000000000000000010110001111011011

One's complement11111111111111101001110000100100at 32 bits, every bit flipped

Bits reversed11011011110001101000000000000000at 32 bits

Rotated left by 100000000000000101100011110110110at 32 bits, wrapping

Shifted left by 1101100011110110110= 182,198, no wrap

Shifted right by 11011000111101101= 45,549, discarding the low bit

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

Nearest landmarks

Next prime91,121+22

Previous prime91,097−2

Distance to nearest prime0, it is prime

Nearest square below90,601

Nearest square above91,204

Powers & multiples

91,099 to the power 28,299,027,801

91,099 to the power 3756,033,133,643,299

91,099 to the power 468,873,862,441,770,895,601

91,099 to the power 56,274,339,994,582,886,818,355,499

First ten multiples91,099, 182,198, 273,297, 364,396, 455,495, 546,594, 637,693, 728,792, 819,891, 910,990

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 3

Divisible by 9No, remainder 1

Divisible by 10No, remainder 9

Divisible by 11No, remainder 8

Divisible by 12No, remainder 7

Divisible by 100No, remainder 99

Collatz (3n + 1) trajectory

Steps to reach 184the total stopping time

Highest value reached691,7927× the starting value

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

First steps91,099 → 273,298 → 136,649 → 409,948 → 204,974 → 102,487 → 307,462 → 153,731 → 461,194 → 230,597 → …

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

As a percentage & fraction

As a percentage9,109,900%

91,099% as a decimal910.99

91,099% of 10091,099

91,099% of 1,000910,990

As a fraction of 10091,099/100

Read another way

As seconds1 day, 1 hour and 18 minutes

As bytes88.964 KiB

As a 24-bit colour#0163DB

Keep nerding

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