Recognised as Number
93,002
- Positive
- Even
- Composite
- 5 digits
93,002 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value93,002
Digit count5
Digit sum14
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 7^2 × 13 × 73
Distinct prime factors42, 7, 13, 73
Number of divisors24
Sum of divisors σ(n)177,156
Aliquot sum84,154sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)36,288integers below n that share no factor with it
Carmichael function λ(n)504the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 36,288
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 7, 13, 14, 26, 49, 73, 91, 98, 146, 182, 511, 637, 949, 1,022, 1,274, 1,898, 3,577, 6,643, 7,154, 13,286, 46,501, 93,00224 in total
Arithmetic
Representations
Decimal93,002
Binary1011010110100101017 bits
Octal265512
Hexadecimal16B4A
Base 361ZRE
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-three thousand and two
Ordinalninety-three thousand and second
Scientific notation9.3002 × 10^4
Engineering notation93.002 × 10^3
In other bases
Ternary11201120112base 3; the most digit-efficient integer base after e: 11 digits
Quinary10434002base 5; one hand: 8 digits
Septenary535100base 7: 6 digits
Nonary151515base 9; each digit is two ternary digits: 6 digits
Duodecimal459a2base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalbca2base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal25:50:2base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TTT1TTT1TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101011111101011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010110101101001010
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 6b 4a
Gray code11101111011101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010110101101001010
64-bit0000000000000000000000000000000000000000000000010110101101001010
One's complement11111111111111101001010010110101at 32 bits, every bit flipped
Bits reversed01010010110101101000000000000000at 32 bits
Rotated left by 100000000000000101101011010010100at 32 bits, wrapping
Shifted left by 1101101011010010100= 186,004, no wrap
Shifted right by 11011010110100101= 46,501, discarding the low bit
These bits as a double4.59490932 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
93,002 to the power 28,649,372,004
93,002 to the power 3804,408,895,116,008
93,002 to the power 474,811,636,063,578,976,016
93,002 to the power 56,957,631,777,184,971,927,440,032
First ten multiples93,002, 186,004, 279,006, 372,008, 465,010, 558,012, 651,014, 744,016, 837,018, 930,020
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9No, remainder 5
Divisible by 10No, remainder 2
Divisible by 11No, remainder 8
Divisible by 12No, remainder 2
Divisible by 100No, remainder 2
Collatz (3n + 1) trajectory
Steps to reach 1177the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps93,002 → 46,501 → 139,504 → 69,752 → 34,876 → 17,438 → 8,719 → 26,158 → 13,079 → 39,238 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage9,300,200%
93,002% as a decimal930.02
93,002% of 10093,002
93,002% of 1,000930,020
As a fraction of 10093,002/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,002
Nerdulate something else
Nothing in mind? Surprise me · today’s page