Recognised as Number
1,076,323
- Positive
- Odd
- Prime
- 7 digits
1,076,323 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,076,323
Digit count7
Digit sum22
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 factorisation1,076,323
Distinct prime factors11,076,323
Number of divisors2
Sum of divisors σ(n)1,076,324
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,076,322integers below n that share no factor with it
Carmichael function λ(n)1,076,322the 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, 1,076,3232 in total
Arithmetic
Previous number1,076,322
Next number1,076,324
Double2,152,646
Half538,161.5
Square1,158,471,200,329
Cube1,246,889,197,751,710,267
Square root1,037.459878742≈irrational, shown to 9 decimal places
Cube root102.481987713≈
Negation-1,076,323
Reciprocal9.2908913 × 10^-7≈
Representations
Decimal1,076,323
Binary10000011011000110001121 bits
Octal4066143
Hexadecimal106C63
Base 36N2HV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seventy-six thousand, three hundred and twenty-three
Ordinalone million, seventy-six thousand, three hundred and twenty-third
Scientific notation1.076323 × 10^6
Engineering notation1.076323 × 10^6
In other bases
Ternary2000200102211base 3; the most digit-efficient integer base after e: 13 digits
Quinary233420243base 5; one hand: 9 digits
Septenary12101653base 7: 8 digits
Nonary2020384base 9; each digit is two ternary digits: 7 digits
Duodecimal43aa57base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6eag3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:58:58:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T001T00110T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011011110110100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000110110001100011
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes310 6c 63
Gray code110000101101001010010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000110110001100011
64-bit0000000000000000000000000000000000000000000100000110110001100011
One's complement11111111111011111001001110011100at 32 bits, every bit flipped
Bits reversed11000110001101100000100000000000at 32 bits
Rotated left by 100000000001000001101100011000110at 32 bits, wrapping
Shifted left by 11000001101100011000110= 2,152,646, no wrap
Shifted right by 110000011011000110001= 538,161, discarding the low bit
These bits as a double5.31774218 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,076,323 to the power 21,158,471,200,329
1,076,323 to the power 31,246,889,197,751,710,267
1,076,323 to the power 41,342,055,521,991,714,049,708,241
1,076,323 to the power 51,444,485,225,596,687,641,124,123,077,843
First ten multiples1,076,323, 2,152,646, 3,228,969, 4,305,292, 5,381,615, 6,457,938, 7,534,261, 8,610,584, 9,686,907, 10,763,230
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
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 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 23
Collatz (3n + 1) trajectory
Steps to reach 1121the total stopping time
Highest value reached4,843,4564× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,076,323 → 3,228,970 → 1,614,485 → 4,843,456 → 2,421,728 → 1,210,864 → 605,432 → 302,716 → 151,358 → 75,679 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage107,632,300%
1,076,323% as a decimal10,763.23
1,076,323% of 1001,076,323
1,076,323% of 1,00010,763,230
As a fraction of 1001,076,323/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,076,323
Nerdulate something else
Nothing in mind? Surprise me · today’s page