Recognised as Number
1,206,117
- Positive
- Odd
- Composite
- 7 digits
1,206,117 is an odd 7-digit integer and a composite number. It has 32 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,206,117
Digit count7
Digit sum18
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^3 × 11 × 31 × 131
Distinct prime factors43, 11, 31, 131
Number of divisors32
Sum of divisors σ(n)2,027,520
Aliquot sum821,403sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)702,000integers below n that share no factor with it
Carmichael function λ(n)1,170the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 702,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 11, 27, 31, 33, 93, 99, 131, 279, 297, 341, 393, 837, 1,023, 1,179, 1,441, 3,069, 3,537, 4,061, 4,323, 9,207, 12,183, 12,969, 36,549, 38,907, 44,671, 109,647, 134,013, 402,039, 1,206,11732 in total
Arithmetic
Previous number1,206,116
Next number1,206,118
Double2,412,234
Half603,058.5
Square1,454,718,217,689
Cube1,754,560,372,564,403,613
Square root1,098.233581712≈irrational, shown to 9 decimal places
Cube root106.446114379≈
Negation-1,206,117
Reciprocal8.29106961 × 10^-7≈
Representations
Decimal1,206,117
Binary10010011001110110010121 bits
Octal4463545
Hexadecimal126765
Base 36PUN9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and six thousand, one hundred and seventeen
Ordinalone million, two hundred and six thousand, one hundred and seventeenth
Scientific notation1.206117 × 10^6
Engineering notation1.206117 × 10^6
In other bases
Ternary2021021111000base 3; the most digit-efficient integer base after e: 13 digits
Quinary302043432base 5; one hand: 9 digits
Septenary13152243base 7: 8 digits
Nonary2237430base 9; each digit is two ternary digits: 7 digits
Duodecimal4a1b99base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7af5hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:35:1:57base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T11T1111000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101111011100010100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100100110011101100101
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
Bytes312 67 65
Gray code110110101010011010111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100100110011101100101
64-bit0000000000000000000000000000000000000000000100100110011101100101
One's complement11111111111011011001100010011010at 32 bits, every bit flipped
Bits reversed10100110111001100100100000000000at 32 bits
Rotated left by 100000000001001001100111011001010at 32 bits, wrapping
Shifted left by 11001001100111011001010= 2,412,234, no wrap
Shifted right by 110010011001110110010= 603,058, discarding the low bit
These bits as a double5.95900975 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,206,117 to the power 21,454,718,217,689
1,206,117 to the power 31,754,560,372,564,403,613
1,206,117 to the power 42,116,205,092,876,260,792,500,721
1,206,117 to the power 52,552,390,938,004,637,038,268,592,110,357
First ten multiples1,206,117, 2,412,234, 3,618,351, 4,824,468, 6,030,585, 7,236,702, 8,442,819, 9,648,936, 10,855,053, 12,061,170
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11Yes
Divisible by 12No, remainder 9
Divisible by 100No, remainder 17
Collatz (3n + 1) trajectory
Steps to reach 167the total stopping time
Highest value reached3,618,3523× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,206,117 → 3,618,352 → 1,809,176 → 904,588 → 452,294 → 226,147 → 678,442 → 339,221 → 1,017,664 → 508,832 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage120,611,700%
1,206,117% as a decimal12,061.17
1,206,117% of 1001,206,117
1,206,117% of 1,00012,061,170
As a fraction of 1001,206,117/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,206,117
Nerdulate something else
Nothing in mind? Surprise me · today’s page