Recognised as Number
1,072,303
- Positive
- Odd
- Composite
- 7 digits
1,072,303 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,072,303
Digit count7
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation19 × 56,437
Distinct prime factors219, 56,437
Number of divisors4
Sum of divisors σ(n)1,128,760
Aliquot sum56,457sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,015,848integers below n that share no factor with it
Carmichael function λ(n)169,308the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,015,848
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 19, 56,437, 1,072,3034 in total
Arithmetic
Previous number1,072,302
Next number1,072,304
Double2,144,606
Half536,151.5
Square1,149,833,723,809
Cube1,232,970,151,541,562,127
Square root1,035.520641996≈irrational, shown to 9 decimal places
Cube root102.354240571≈
Negation-1,072,303
Reciprocal9.3257223 × 10^-7≈
Representations
Decimal1,072,303
Binary10000010111001010111121 bits
Octal4056257
Hexadecimal105CAF
Base 36MZE7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seventy-two thousand, three hundred and three
Ordinalone million, seventy-two thousand, three hundred and third
Scientific notation1.072303 × 10^6
Engineering notation1.072303 × 10^6
In other bases
Ternary2000110220221base 3; the most digit-efficient integer base after e: 13 digits
Quinary233303203base 5; one hand: 9 digits
Septenary12054151base 7: 8 digits
Nonary2013827base 9; each digit is two ternary digits: 7 digits
Duodecimal438667base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6e0f3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:57:51:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0001110T10T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011010110111110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000101110010101111
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 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 5c af
Gray code110000111001011111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000101110010101111
64-bit0000000000000000000000000000000000000000000100000101110010101111
One's complement11111111111011111010001101010000at 32 bits, every bit flipped
Bits reversed11110101001110100000100000000000at 32 bits
Rotated left by 100000000001000001011100101011110at 32 bits, wrapping
Shifted left by 11000001011100101011110= 2,144,606, no wrap
Shifted right by 110000010111001010111= 536,151, discarding the low bit
These bits as a double5.29788074 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,072,303 to the power 21,149,833,723,809
1,072,303 to the power 31,232,970,151,541,562,127
1,072,303 to the power 41,322,117,592,408,471,693,468,481
1,072,303 to the power 51,417,710,660,692,381,422,321,332,581,743
First ten multiples1,072,303, 2,144,606, 3,216,909, 4,289,212, 5,361,515, 6,433,818, 7,506,121, 8,578,424, 9,650,727, 10,723,030
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 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 3
Collatz (3n + 1) trajectory
Steps to reach 1240the total stopping time
Highest value reached22,010,45220× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,072,303 → 3,216,910 → 1,608,455 → 4,825,366 → 2,412,683 → 7,238,050 → 3,619,025 → 10,857,076 → 5,428,538 → 2,714,269 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage107,230,300%
1,072,303% as a decimal10,723.03
1,072,303% of 1001,072,303
1,072,303% of 1,00010,723,030
As a fraction of 1001,072,303/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,072,303
Nerdulate something else
Nothing in mind? Surprise me · today’s page