Recognised as Number
1,201,709
- Positive
- Odd
- Prime
- 7 digits
1,201,709 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,201,709
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 numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,201,709
Distinct prime factors11,201,709
Number of divisors2
Sum of divisors σ(n)1,201,710
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,201,708integers below n that share no factor with it
Carmichael function λ(n)1,201,708the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,201,7092 in total
Arithmetic
Previous number1,201,708
Next number1,201,710
Double2,403,418
Half600,854.5
Square1,444,104,520,681
Cube1,735,393,399,443,043,829
Square root1,096.224885687≈irrational, shown to 9 decimal places
Cube root106.316279753≈
Negation-1,201,709
Reciprocal8.32148216 × 10^-7≈
Representations
Decimal1,201,709
Binary10010010101100010110121 bits
Octal4453055
Hexadecimal12562D
Base 36PR8T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and one thousand, seven hundred and nine
Ordinalone million, two hundred and one thousand, seven hundred and ninth
Scientific notation1.201709 × 10^6
Engineering notation1.201709 × 10^6
In other bases
Ternary2021001102202base 3; the most digit-efficient integer base after e: 13 digits
Quinary301423314base 5; one hand: 9 digits
Septenary13133345base 7: 8 digits
Nonary2231382base 9; each digit is two ternary digits: 7 digits
Duodecimal49b525base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7a459base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:33:48:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T1001110T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101111010101001111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100100101011000101101
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 2d
Gray code110110111110100111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100100101011000101101
64-bit0000000000000000000000000000000000000000000100100101011000101101
One's complement11111111111011011010100111010010at 32 bits, every bit flipped
Bits reversed10110100011010100100100000000000at 32 bits
Rotated left by 100000000001001001010110001011010at 32 bits, wrapping
Shifted left by 11001001010110001011010= 2,403,418, no wrap
Shifted right by 110010010101100010110= 600,854, discarding the low bit
These bits as a double5.93723133 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,201,709 to the power 21,444,104,520,681
1,201,709 to the power 31,735,393,399,443,043,829
1,201,709 to the power 42,085,437,866,651,300,756,703,761
1,201,709 to the power 52,506,089,453,295,667,981,037,719,927,549
First ten multiples1,201,709, 2,403,418, 3,605,127, 4,806,836, 6,008,545, 7,210,254, 8,411,963, 9,613,672, 10,815,381, 12,017,090
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 5
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1191the total stopping time
Highest value reached3,605,1283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,201,709 → 3,605,128 → 1,802,564 → 901,282 → 450,641 → 1,351,924 → 675,962 → 337,981 → 1,013,944 → 506,972 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage120,170,900%
1,201,709% as a decimal12,017.09
1,201,709% of 1001,201,709
1,201,709% of 1,00012,017,090
As a fraction of 1001,201,709/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,709
Nerdulate something else
Nothing in mind? Surprise me · today’s page