Recognised as Number
1,201,689
- Positive
- Odd
- Composite
- 7 digits
1,201,689 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,201,689
Digit count7
Digit sum27
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 numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3^3 × 44,507
Distinct prime factors23, 44,507
Number of divisors8
Sum of divisors σ(n)1,780,320
Aliquot sum578,631sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)801,108integers below n that share no factor with it
Carmichael function λ(n)400,554the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 801,108
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 44,507, 133,521, 400,563, 1,201,6898 in total
Arithmetic
Previous number1,201,688
Next number1,201,690
Double2,403,378
Half600,844.5
Square1,444,056,452,721
Cube1,735,306,754,613,845,769
Square root1,096.215763433≈irrational, shown to 9 decimal places
Cube root106.315689943≈
Negation-1,201,689
Reciprocal8.32162065 × 10^-7≈
Representations
Decimal1,201,689
Binary10010010101100001100121 bits
Octal4453031
Hexadecimal125619
Base 36PR89
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and one thousand, six hundred and eighty-nine
Ordinalone million, two hundred and one thousand, six hundred and eighty-ninth
Scientific notation1.201689 × 10^6
Engineering notation1.201689 × 10^6
In other bases
Ternary2021001102000base 3; the most digit-efficient integer base after e: 13 digits
Quinary301423224base 5; one hand: 9 digits
Septenary13133316base 7: 8 digits
Nonary2231360base 9; each digit is two ternary digits: 7 digits
Duodecimal49b509base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7a449base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:33:48:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T100111T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101111010101001101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100100101011000011001
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 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 56 19
Gray code110110111110100010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100100101011000011001
64-bit0000000000000000000000000000000000000000000100100101011000011001
One's complement11111111111011011010100111100110at 32 bits, every bit flipped
Bits reversed10011000011010100100100000000000at 32 bits
Rotated left by 100000000001001001010110000110010at 32 bits, wrapping
Shifted left by 11001001010110000110010= 2,403,378, no wrap
Shifted right by 110010010101100001100= 600,844, discarding the low bit
These bits as a double5.93713252 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,201,689 to the power 21,444,056,452,721
1,201,689 to the power 31,735,306,754,613,845,769
1,201,689 to the power 42,085,299,038,645,157,708,303,841
1,201,689 to the power 52,505,880,916,450,460,921,333,934,387,449
First ten multiples1,201,689, 2,403,378, 3,605,067, 4,806,756, 6,008,445, 7,210,134, 8,411,823, 9,613,512, 10,815,201, 12,016,890
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 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 9
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1191the total stopping time
Highest value reached5,481,4124× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,201,689 → 3,605,068 → 1,802,534 → 901,267 → 2,703,802 → 1,351,901 → 4,055,704 → 2,027,852 → 1,013,926 → 506,963 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage120,168,900%
1,201,689% as a decimal12,016.89
1,201,689% of 1001,201,689
1,201,689% of 1,00012,016,890
As a fraction of 1001,201,689/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,689
Nerdulate something else
Nothing in mind? Surprise me · today’s page