Recognised as Number
1,033,906
- Positive
- Even
- Composite
- 7 digits
1,033,906 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,033,906
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 factorisation2 × 17 × 47 × 647
Distinct prime factors42, 17, 47, 647
Number of divisors16
Sum of divisors σ(n)1,679,616
Aliquot sum645,710sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)475,456integers below n that share no factor with it
Carmichael function λ(n)118,864the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 475,456
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 17, 34, 47, 94, 647, 799, 1,294, 1,598, 10,999, 21,998, 30,409, 60,818, 516,953, 1,033,90616 in total
Arithmetic
Previous number1,033,905
Next number1,033,907
Double2,067,812
Half516,953
Square1,068,961,616,836
Cube1,105,205,829,416,441,416
Square root1,016.811683646≈irrational, shown to 9 decimal places
Cube root101.117661783≈
Negation-1,033,906
Reciprocal9.67205916 × 10^-7≈
Representations
Decimal1,033,906
Binary1111110001101011001020 bits
Octal3743262
HexadecimalFC6B2
Base 36M5RM
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, thirty-three thousand, nine hundred and six
Ordinalone million, thirty-three thousand, nine hundred and sixth
Scientific notation1.033906 × 10^6
Engineering notation1.033906 × 10^6
In other bases
Ternary1221112020211base 3; the most digit-efficient integer base after e: 13 digits
Quinary231041111base 5; one hand: 9 digits
Septenary11534206base 7: 8 digits
Nonary1845224base 9; each digit is two ternary digits: 7 digits
Duodecimal41a3aabase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal694f6base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:47:11:46base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00TTTT1T1T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001101101111110110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011111100011010110010
Bit length20 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits8within that length
Bit parityeven12 set bits, so even; not the same as the number itself being even
Highest set bitbit 19worth 524,288
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes30f c6 b2
Gray code10000010010111101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011111100011010110010
64-bit0000000000000000000000000000000000000000000011111100011010110010
One's complement11111111111100000011100101001101at 32 bits, every bit flipped
Bits reversed01001101011000111111000000000000at 32 bits
Rotated left by 100000000000111111000110101100100at 32 bits, wrapping
Shifted left by 1111111000110101100100= 2,067,812, no wrap
Shifted right by 11111110001101011001= 516,953, discarding the low bit
These bits as a double5.10817436 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,033,906 to the power 21,068,961,616,836
1,033,906 to the power 31,105,205,829,416,441,416
1,033,906 to the power 41,142,678,938,268,635,278,650,896
1,033,906 to the power 51,181,422,610,349,571,626,408,833,279,776
First ten multiples1,033,906, 2,067,812, 3,101,718, 4,135,624, 5,169,530, 6,203,436, 7,237,342, 8,271,248, 9,305,154, 10,339,060
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 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 2
Divisible by 9No, remainder 4
Divisible by 10No, remainder 6
Divisible by 11No, remainder 5
Divisible by 12No, remainder 10
Divisible by 100No, remainder 6
Collatz (3n + 1) trajectory
Steps to reach 1196the total stopping time
Highest value reached1,744,7201× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,033,906 → 516,953 → 1,550,860 → 775,430 → 387,715 → 1,163,146 → 581,573 → 1,744,720 → 872,360 → 436,180 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage103,390,600%
1,033,906% as a decimal10,339.06
1,033,906% of 1001,033,906
1,033,906% of 1,00010,339,060
As a fraction of 1001,033,906/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,033,906
Nerdulate something else
Nothing in mind? Surprise me · today’s page