Recognised as Number
1,023,304
- Positive
- Even
- Composite
- 7 digits
1,023,304 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,023,304
Digit count7
Digit sum13
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 × 127,913
Distinct prime factors22, 127,913
Number of divisors8
Sum of divisors σ(n)1,918,710
Aliquot sum895,406sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)511,648integers below n that share no factor with it
Carmichael function λ(n)127,912the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 511,648
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 127,913, 255,826, 511,652, 1,023,3048 in total
Arithmetic
Previous number1,023,303
Next number1,023,305
Double2,046,608
Half511,652
Square1,047,151,076,416
Cube1,071,553,885,100,798,464
Square root1,011.584895103≈irrational, shown to 9 decimal places
Cube root100.770842747≈
Negation-1,023,304
Reciprocal9.77226709 × 10^-7≈
Representations
Decimal1,023,304
Binary1111100111010100100020 bits
Octal3716510
HexadecimalF9D48
Base 36LXL4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, twenty-three thousand, three hundred and four
Ordinalone million, twenty-three thousand, three hundred and fourth
Scientific notation1.023304 × 10^6
Engineering notation1.023304 × 10^6
In other bases
Ternary1220222201011base 3; the most digit-efficient integer base after e: 13 digits
Quinary230221204base 5; one hand: 9 digits
Septenary11461252base 7: 8 digits
Nonary1828634base 9; each digit is two ternary digits: 7 digits
Duodecimal414234base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal67i54base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:44:15:4base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T1000T01011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001110110101011000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011111001110101001000
Bit length20 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits9within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 19worth 524,288
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes30f 9d 48
Gray code10000101001111101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011111001110101001000
64-bit0000000000000000000000000000000000000000000011111001110101001000
One's complement11111111111100000110001010110111at 32 bits, every bit flipped
Bits reversed00010010101110011111000000000000at 32 bits
Rotated left by 100000000000111110011101010010000at 32 bits, wrapping
Shifted left by 1111110011101010010000= 2,046,608, no wrap
Shifted right by 11111100111010100100= 511,652, discarding the low bit
These bits as a double5.05579352 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,023,304 to the power 21,047,151,076,416
1,023,304 to the power 31,071,553,885,100,798,464
1,023,304 to the power 41,096,525,376,839,187,471,405,056
1,023,304 to the power 51,122,078,804,221,047,896,238,679,425,024
First ten multiples1,023,304, 2,046,608, 3,069,912, 4,093,216, 5,116,520, 6,139,824, 7,163,128, 8,186,432, 9,209,736, 10,233,040
Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)
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 7
Divisible by 12No, remainder 4
Divisible by 100No, remainder 4
Collatz (3n + 1) trajectory
Steps to reach 1227the total stopping time
Highest value reached2,185,5402× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,023,304 → 511,652 → 255,826 → 127,913 → 383,740 → 191,870 → 95,935 → 287,806 → 143,903 → 431,710 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage102,330,400%
1,023,304% as a decimal10,233.04
1,023,304% of 1001,023,304
1,023,304% of 1,00010,233,040
As a fraction of 1001,023,304/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,023,304
Nerdulate something else
Nothing in mind? Surprise me · today’s page