Recognised as Number
8,094,091
- Positive
- Odd
- Composite
- 7 digits
8,094,091 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value8,094,091
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 factorisation17 × 23 × 127 × 163
Distinct prime factors417, 23, 127, 163
Number of divisors16
Sum of divisors σ(n)9,068,544
Aliquot sum974,453sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,185,024integers below n that share no factor with it
Carmichael function λ(n)99,792the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 7,185,024
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 17, 23, 127, 163, 391, 2,159, 2,771, 2,921, 3,749, 20,701, 49,657, 63,733, 351,917, 476,123, 8,094,09116 in total
Arithmetic
Previous number8,094,090
Next number8,094,092
Double16,188,182
Half4,047,045.5
Square65,514,309,116,281
Cube530,278,779,789,307,995,571
Square root2,845.011599273≈irrational, shown to 9 decimal places
Cube root200.781037598≈
Negation-8,094,091
Reciprocal1.23546918 × 10^-7≈
Representations
Decimal8,094,091
Binary1111011100000011000101123 bits
Octal36700613
Hexadecimal7B818B
Base 364THFV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, ninety-four thousand and ninety-one
Ordinaleight million, ninety-four thousand and ninety-first
Scientific notation8.094091 × 10^6
Engineering notation8.094091 × 10^6
In other bases
Ternary120020020000011base 3; the most digit-efficient integer base after e: 15 digits
Quinary4033002331base 5; one hand: 10 digits
Septenary125540635base 7: 9 digits
Nonary16206004base 9; each digit is two ternary digits: 8 digits
Duodecimal28640b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2abf4bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal37:28:21:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT01T01T0000011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100011001000011010011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011110111000000110001011
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes37b 81 8b
Gray code10001100100000101001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011110111000000110001011
64-bit0000000000000000000000000000000000000000011110111000000110001011
One's complement11111111100001000111111001110100at 32 bits, every bit flipped
Bits reversed11010001100000011101111000000000at 32 bits
Rotated left by 100000000111101110000001100010110at 32 bits, wrapping
Shifted left by 1111101110000001100010110= 16,188,182, no wrap
Shifted right by 11111011100000011000101= 4,047,045, discarding the low bit
These bits as a double3.9990123 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,094,091 to the power 265,514,309,116,281
8,094,091 to the power 3530,278,779,789,307,995,571
8,094,091 to the power 44,292,124,698,983,619,743,179,270,961
8,094,091 to the power 534,740,847,896,921,025,710,689,648,471,991,451
First ten multiples8,094,091, 16,188,182, 24,282,273, 32,376,364, 40,470,455, 48,564,546, 56,658,637, 64,752,728, 72,846,819, 80,940,910
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1111the total stopping time
Highest value reached124,606,24015× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,094,091 → 24,282,274 → 12,141,137 → 36,423,412 → 18,211,706 → 9,105,853 → 27,317,560 → 13,658,780 → 6,829,390 → 3,414,695 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage809,409,100%
8,094,091% as a decimal80,940.91
8,094,091% of 1008,094,091
8,094,091% of 1,00080,940,910
As a fraction of 1008,094,091/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,094,091
Nerdulate something else
Nothing in mind? Surprise me · today’s page