Recognised as Number
8,993,101
- Positive
- Odd
- Composite
- 7 digits
8,993,101 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value8,993,101
Digit count7
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation13 × 233 × 2,969
Distinct prime factors313, 233, 2,969
Number of divisors8
Sum of divisors σ(n)9,729,720
Aliquot sum736,619sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,262,912integers below n that share no factor with it
Carmichael function λ(n)258,216the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,262,912
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 233, 2,969, 3,029, 38,597, 691,777, 8,993,1018 in total
Arithmetic
Previous number8,993,100
Next number8,993,102
Double17,986,202
Half4,496,550.5
Square80,875,865,596,201
Cube727,324,827,769,060,809,301
Square root2,998.849946229≈irrational, shown to 9 decimal places
Cube root207.955218725≈
Negation-8,993,101
Reciprocal1.11196349 × 10^-7≈
Representations
Decimal8,993,101
Binary10001001001110010100110124 bits
Octal42234515
Hexadecimal89394D
Base 365CR4D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, nine hundred and ninety-three thousand, one hundred and one
Ordinaleight million, nine hundred and ninety-three thousand, one hundred and first
Scientific notation8.993101 × 10^6
Engineering notation8.993101 × 10^6
In other bases
Ternary121220220012211base 3; the most digit-efficient integer base after e: 15 digits
Quinary4300234401base 5; one hand: 10 digits
Septenary136303645base 7: 9 digits
Nonary17826184base 9; each digit is two ternary digits: 8 digits
Duodecimal3018411base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2g42f1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal41:38:5:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T0T10T01T0T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100110010100100101011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010010011100101001101
Bit length24 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits13within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes389 39 4d
Gray code110011011010010111101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010010011100101001101
64-bit0000000000000000000000000000000000000000100010010011100101001101
One's complement11111111011101101100011010110010at 32 bits, every bit flipped
Bits reversed10110010100111001001000100000000at 32 bits
Rotated left by 100000001000100100111001010011010at 32 bits, wrapping
Shifted left by 11000100100111001010011010= 17,986,202, no wrap
Shifted right by 110001001001110010100110= 4,496,550, discarding the low bit
These bits as a double4.44318225 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,993,101 to the power 280,875,865,596,201
8,993,101 to the power 3727,324,827,769,060,809,301
8,993,101 to the power 46,540,905,635,934,768,533,185,632,401
8,993,101 to the power 558,823,025,015,430,602,830,560,243,931,065,501
First ten multiples8,993,101, 17,986,202, 26,979,303, 35,972,404, 44,965,505, 53,958,606, 62,951,707, 71,944,808, 80,937,909, 89,931,010
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1111the total stopping time
Highest value reached26,979,3043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,993,101 → 26,979,304 → 13,489,652 → 6,744,826 → 3,372,413 → 10,117,240 → 5,058,620 → 2,529,310 → 1,264,655 → 3,793,966 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage899,310,100%
8,993,101% as a decimal89,931.01
8,993,101% of 1008,993,101
8,993,101% of 1,00089,931,010
As a fraction of 1008,993,101/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 8,993,101
Nerdulate something else
Nothing in mind? Surprise me · today’s page