Recognised as Number
8,993,143
- Positive
- Odd
- Prime
- 7 digits
8,993,143 is an odd 7-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 value8,993,143
Digit count7
Digit sum37
Digit product23,328
Multiplicative persistence5times 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 factorisation8,993,143
Distinct prime factors18,993,143
Number of divisors2
Sum of divisors σ(n)8,993,144
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,993,142integers below n that share no factor with it
Carmichael function λ(n)8,993,142the 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, 8,993,1432 in total
Arithmetic
Previous number8,993,142
Next number8,993,144
Double17,986,286
Half4,496,571.5
Square80,876,621,018,449
Cube727,335,018,175,717,495,207
Square root2,998.856948906≈irrational, shown to 9 decimal places
Cube root207.955542458≈
Negation-8,993,143
Reciprocal1.1119583 × 10^-7≈
Representations
Decimal8,993,143
Binary10001001001110010111011124 bits
Octal42234567
Hexadecimal893977
Base 365CR5J
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, nine hundred and ninety-three thousand, one hundred and forty-three
Ordinaleight million, nine hundred and ninety-three thousand, one hundred and forty-third
Scientific notation8.993143 × 10^6
Engineering notation8.993143 × 10^6
In other bases
Ternary121220220021101base 3; the most digit-efficient integer base after e: 15 digits
Quinary4300240033base 5; one hand: 10 digits
Septenary136304035base 7: 9 digits
Nonary17826241base 9; each digit is two ternary digits: 8 digits
Duodecimal3018447base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2g42h3base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal41:38:5:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T0T10T01T1101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100110010100111010001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010010011100101110111
Bit length24 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits11within that length
Bit parityodd13 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 77
Gray code110011011010010111001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010010011100101110111
64-bit0000000000000000000000000000000000000000100010010011100101110111
One's complement11111111011101101100011010001000at 32 bits, every bit flipped
Bits reversed11101110100111001001000100000000at 32 bits
Rotated left by 100000001000100100111001011101110at 32 bits, wrapping
Shifted left by 11000100100111001011101110= 17,986,286, no wrap
Shifted right by 110001001001110010111011= 4,496,571, discarding the low bit
These bits as a double4.443203 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,993,143 to the power 280,876,621,018,449
8,993,143 to the power 3727,335,018,175,717,495,207
8,993,143 to the power 46,541,027,827,361,826,561,998,365,601
8,993,143 to the power 558,824,398,618,444,219,013,249,667,616,073,943
First ten multiples8,993,143, 17,986,286, 26,979,429, 35,972,572, 44,965,715, 53,958,858, 62,952,001, 71,945,144, 80,938,287, 89,931,430
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 43
Collatz (3n + 1) trajectory
Steps to reach 1225the total stopping time
Highest value reached60,703,7206× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,993,143 → 26,979,430 → 13,489,715 → 40,469,146 → 20,234,573 → 60,703,720 → 30,351,860 → 15,175,930 → 7,587,965 → 22,763,896 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage899,314,300%
8,993,143% as a decimal89,931.43
8,993,143% of 1008,993,143
8,993,143% of 1,00089,931,430
As a fraction of 1008,993,143/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,143
Nerdulate something else
Nothing in mind? Surprise me · today’s page