Recognised as Number
1,201,763
- Positive
- Odd
- Composite
- 7 digits
1,201,763 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,201,763
Digit count7
Digit sum20
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation883 × 1,361
Distinct prime factors2883, 1,361
Number of divisors4
Sum of divisors σ(n)1,204,008
Aliquot sum2,245sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,199,520integers below n that share no factor with it
Carmichael function λ(n)599,760the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,199,520
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 883, 1,361, 1,201,7634 in total
Arithmetic
Previous number1,201,762
Next number1,201,764
Double2,403,526
Half600,881.5
Square1,444,234,308,169
Cube1,735,627,354,888,101,947
Square root1,096.249515393≈irrational, shown to 9 decimal places
Cube root106.317872205≈
Negation-1,201,763
Reciprocal8.32110824 × 10^-7≈
Representations
Decimal1,201,763
Binary10010010101100110001121 bits
Octal4453143
Hexadecimal125663
Base 36PRAB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and one thousand, seven hundred and sixty-three
Ordinalone million, two hundred and one thousand, seven hundred and sixty-third
Scientific notation1.201763 × 10^6
Engineering notation1.201763 × 10^6
In other bases
Ternary2021001111202base 3; the most digit-efficient integer base after e: 13 digits
Quinary301424023base 5; one hand: 9 digits
Septenary13133453base 7: 8 digits
Nonary2231452base 9; each digit is two ternary digits: 7 digits
Duodecimal49b56bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7a483base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:33:49:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T101TTTTT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101111010101110100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100100101011001100011
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; 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 56 63
Gray code110110111110101010010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100100101011001100011
64-bit0000000000000000000000000000000000000000000100100101011001100011
One's complement11111111111011011010100110011100at 32 bits, every bit flipped
Bits reversed11000110011010100100100000000000at 32 bits
Rotated left by 100000000001001001010110011000110at 32 bits, wrapping
Shifted left by 11001001010110011000110= 2,403,526, no wrap
Shifted right by 110010010101100110001= 600,881, discarding the low bit
These bits as a double5.93749813 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,201,763 to the power 21,444,234,308,169
1,201,763 to the power 31,735,627,354,888,101,947
1,201,763 to the power 42,085,812,736,892,390,060,132,561
1,201,763 to the power 52,506,652,572,126,009,355,835,086,905,043
First ten multiples1,201,763, 2,403,526, 3,605,289, 4,807,052, 6,008,815, 7,210,578, 8,412,341, 9,614,104, 10,815,867, 12,017,630
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1297the total stopping time
Highest value reached9,635,9208× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,201,763 → 3,605,290 → 1,802,645 → 5,407,936 → 2,703,968 → 1,351,984 → 675,992 → 337,996 → 168,998 → 84,499 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage120,176,300%
1,201,763% as a decimal12,017.63
1,201,763% of 1001,201,763
1,201,763% of 1,00012,017,630
As a fraction of 1001,201,763/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,201,763
Nerdulate something else
Nothing in mind? Surprise me · today’s page