Recognised as Number
1,106,012
- Positive
- Even
- Composite
- 7 digits
1,106,012 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,106,012
Digit count7
Digit sum11
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 276,503
Distinct prime factors22, 276,503
Number of divisors6
Sum of divisors σ(n)1,935,528
Aliquot sum829,516sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)553,004integers below n that share no factor with it
Carmichael function λ(n)276,502the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 553,004
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 276,503, 553,006, 1,106,0126 in total
Arithmetic
Previous number1,106,011
Next number1,106,013
Double2,212,024
Half553,006
Square1,223,262,544,144
Cube1,352,943,052,973,793,728
Square root1,051.671051232≈irrational, shown to 9 decimal places
Cube root103.415732634≈
Negation-1,106,012
Reciprocal9.04149322 × 10^-7≈
Representations
Decimal1,106,012
Binary10000111000000101110021 bits
Octal4160134
Hexadecimal10E05C
Base 36NPEK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and six thousand and twelve
Ordinalone million, one hundred and six thousand and twelfth
Scientific notation1.106012 × 10^6
Engineering notation1.106012 × 10^6
In other bases
Ternary2002012011102base 3; the most digit-efficient integer base after e: 13 digits
Quinary240343022base 5; one hand: 9 digits
Septenary12254345base 7: 8 digits
Nonary2065142base 9; each digit is two ternary digits: 7 digits
Duodecimal454078base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6i50cbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:7:13:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T1TT01111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010010000110101100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100001110000001011100
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 22 trailing zeros
Power of twoNo
Bytes310 e0 5c
Gray code110001001000001110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100001110000001011100
64-bit0000000000000000000000000000000000000000000100001110000001011100
One's complement11111111111011110001111110100011at 32 bits, every bit flipped
Bits reversed00111010000001110000100000000000at 32 bits
Rotated left by 100000000001000011100000010111000at 32 bits, wrapping
Shifted left by 11000011100000010111000= 2,212,024, no wrap
Shifted right by 110000111000000101110= 553,006, discarding the low bit
These bits as a double5.46442533 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,106,012 to the power 21,223,262,544,144
1,106,012 to the power 31,352,943,052,973,793,728
1,106,012 to the power 41,496,371,251,905,651,548,692,736
1,106,012 to the power 51,655,004,561,062,673,480,672,750,328,832
First ten multiples1,106,012, 2,212,024, 3,318,036, 4,424,048, 5,530,060, 6,636,072, 7,742,084, 8,848,096, 9,954,108, 11,060,120
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 5
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12No, remainder 8
Divisible by 100No, remainder 12
Collatz (3n + 1) trajectory
Steps to reach 159the total stopping time
Highest value reached1,866,4001× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,106,012 → 553,006 → 276,503 → 829,510 → 414,755 → 1,244,266 → 622,133 → 1,866,400 → 933,200 → 466,600 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage110,601,200%
1,106,012% as a decimal11,060.12
1,106,012% of 1001,106,012
1,106,012% of 1,00011,060,120
As a fraction of 1001,106,012/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,106,012
Nerdulate something else
Nothing in mind? Surprise me · today’s page