Nerdulator> put something in

Recognised as Number

91,467

  • Positive
  • Odd
  • Composite
  • 5 digits

91,467 is an odd 5-digit integer and a composite number. It has 6 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value91,467
Digit count5
Digit sum27
Digit product1,512
Multiplicative persistence3times 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 numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 10,163
Distinct prime factors23, 10,163
Number of divisors6
Sum of divisors σ(n)132,132
Aliquot sum40,665sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)60,972integers below n that share no factor with it
Carmichael function λ(n)30,486the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 60,972
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 10,163, 30,489, 91,4676 in total

Arithmetic

Previous number91,466
Next number91,468
Double182,934
Square root302.435117009≈irrational, shown to 9 decimal places
Cube root45.056226014≈
Negation-91,467
Reciprocal0.0000109329≈

Representations

Decimal91,467
Binary1011001010100101117 bits
Octal262513
Hexadecimal1654B
Base 361YKR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-one thousand, four hundred and sixty-seven
Ordinalninety-one thousand, four hundred and sixty-seventh
Scientific notation9.1467 × 10^4
Engineering notation91.467 × 10^3

In other bases

Ternary11122110200base 3; the most digit-efficient integer base after e: 11 digits
Quinary10411332base 5; one hand: 8 digits
Septenary530445base 7: 6 digits
Nonary148420base 9; each digit is two ternary digits: 6 digits
Duodecimal44b23base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalb8d7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal25:24:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TTT0T111T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010010101011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010110010101001011
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 odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 65 4b
Gray code11101011111101110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010110010101001011
64-bit0000000000000000000000000000000000000000000000010110010101001011
One's complement11111111111111101001101010110100at 32 bits, every bit flipped
Bits reversed11010010101001101000000000000000at 32 bits
Rotated left by 100000000000000101100101010010110at 32 bits, wrapping
Shifted left by 1101100101010010110= 182,934, no wrap
Shifted right by 11011001010100101= 45,733, discarding the low bit
These bits as a double4.51907024 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime91,493+26
Previous prime91,463−4
Distance to nearest prime4
Nearest square below91,204
Nearest square above91,809

Powers & multiples

91,467 to the power 28,366,212,089
91,467 to the power 3765,232,321,144,563
91,467 to the power 469,993,504,718,129,743,921
91,467 to the power 56,402,095,896,053,173,287,222,107
First ten multiples91,467, 182,934, 274,401, 365,868, 457,335, 548,802, 640,269, 731,736, 823,203, 914,670
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 1133the total stopping time
Highest value reached411,6044× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps91,467 → 274,402 → 137,201 → 411,604 → 205,802 → 102,901 → 308,704 → 154,352 → 77,176 → 38,588 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage9,146,700%
91,467% as a decimal914.67
91,467% of 10091,467
91,467% of 1,000914,670
As a fraction of 10091,467/100

Read another way

As bytes89.323 KiB
As a 24-bit colour#01654B

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