Recognised as Number
1,093,864
- Positive
- Even
- Composite
- 7 digits
1,093,864 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,093,864
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 factorisation2^3 × 136,733
Distinct prime factors22, 136,733
Number of divisors8
Sum of divisors σ(n)2,051,010
Aliquot sum957,146sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)546,928integers below n that share no factor with it
Carmichael function λ(n)136,732the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 546,928
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 136,733, 273,466, 546,932, 1,093,8648 in total
Arithmetic
Previous number1,093,863
Next number1,093,865
Double2,187,728
Half546,932
Square1,196,538,450,496
Cube1,308,850,335,613,356,544
Square root1,045.879534172≈irrational, shown to 9 decimal places
Cube root103.035712002≈
Negation-1,093,864
Reciprocal9.1419043 × 10^-7≈
Representations
Decimal1,093,864
Binary10000101100001110100021 bits
Octal4130350
Hexadecimal10B0E8
Base 36NG14
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, ninety-three thousand, eight hundred and sixty-four
Ordinalone million, ninety-three thousand, eight hundred and sixty-fourth
Scientific notation1.093864 × 10^6
Engineering notation1.093864 × 10^6
In other bases
Ternary2001120111111base 3; the most digit-efficient integer base after e: 13 digits
Quinary240000424base 5; one hand: 9 digits
Septenary12204052base 7: 8 digits
Nonary2046444base 9; each digit is two ternary digits: 7 digits
Duodecimal449034base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6ged4base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:3:51:4base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01TTT0111111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011111000100111000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100001011000011101000
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes310 b0 e8
Gray code110001110100010011100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100001011000011101000
64-bit0000000000000000000000000000000000000000000100001011000011101000
One's complement11111111111011110100111100010111at 32 bits, every bit flipped
Bits reversed00010111000011010000100000000000at 32 bits
Rotated left by 100000000001000010110000111010000at 32 bits, wrapping
Shifted left by 11000010110000111010000= 2,187,728, no wrap
Shifted right by 110000101100001110100= 546,932, discarding the low bit
These bits as a double5.40440624 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,093,864 to the power 21,196,538,450,496
1,093,864 to the power 31,308,850,335,613,356,544
1,093,864 to the power 41,431,704,263,515,368,642,646,016
1,093,864 to the power 51,566,089,752,505,975,204,919,341,645,824
First ten multiples1,093,864, 2,187,728, 3,281,592, 4,375,456, 5,469,320, 6,563,184, 7,657,048, 8,750,912, 9,844,776, 10,938,640
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 4
Divisible by 10No, remainder 4
Divisible by 11No, remainder 2
Divisible by 12No, remainder 4
Divisible by 100No, remainder 64
Collatz (3n + 1) trajectory
Steps to reach 172the total stopping time
Highest value reached1,093,864
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,093,864 → 546,932 → 273,466 → 136,733 → 410,200 → 205,100 → 102,550 → 51,275 → 153,826 → 76,913 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage109,386,400%
1,093,864% as a decimal10,938.64
1,093,864% of 1001,093,864
1,093,864% of 1,00010,938,640
As a fraction of 1001,093,864/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 1,093,864
Nerdulate something else
Nothing in mind? Surprise me · today’s page