Recognised as Number
1,201,951
- Positive
- Odd
- Composite
- 7 digits
1,201,951 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,201,951
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation17^2 × 4,159
Distinct prime factors217, 4,159
Number of divisors6
Sum of divisors σ(n)1,277,120
Aliquot sum75,169sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,130,976integers below n that share no factor with it
Carmichael function λ(n)565,488the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,130,976
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 17, 289, 4,159, 70,703, 1,201,9516 in total
Arithmetic
Previous number1,201,950
Next number1,201,952
Double2,403,902
Half600,975.5
Square1,444,686,206,401
Cube1,736,442,030,469,888,351
Square root1,096.335258942≈irrational, shown to 9 decimal places
Cube root106.323415927≈
Negation-1,201,951
Reciprocal8.31980671 × 10^-7≈
Representations
Decimal1,201,951
Binary10010010101110001111121 bits
Octal4453437
Hexadecimal12571F
Base 36PRFJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and one thousand, nine hundred and fifty-one
Ordinalone million, two hundred and one thousand, nine hundred and fifty-first
Scientific notation1.201951 × 10^6
Engineering notation1.201951 × 10^6
In other bases
Ternary2021001202201base 3; the most digit-efficient integer base after e: 13 digits
Quinary301430301base 5; one hand: 9 digits
Septenary13134142base 7: 8 digits
Nonary2231681base 9; each digit is two ternary digits: 7 digits
Duodecimal49b6a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7a4hbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:33:52:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T101TT10T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101111010101101100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100100101011100011111
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 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 57 1f
Gray code110110111110010010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100100101011100011111
64-bit0000000000000000000000000000000000000000000100100101011100011111
One's complement11111111111011011010100011100000at 32 bits, every bit flipped
Bits reversed11111000111010100100100000000000at 32 bits
Rotated left by 100000000001001001010111000111110at 32 bits, wrapping
Shifted left by 11001001010111000111110= 2,403,902, no wrap
Shifted right by 110010010101110001111= 600,975, discarding the low bit
These bits as a double5.93842697 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,201,951 to the power 21,444,686,206,401
1,201,951 to the power 31,736,442,030,469,888,351
1,201,951 to the power 42,087,118,234,965,312,773,372,801
1,201,951 to the power 52,508,613,849,634,792,653,268,211,534,751
First ten multiples1,201,951, 2,403,902, 3,605,853, 4,807,804, 6,009,755, 7,211,706, 8,413,657, 9,615,608, 10,817,559, 12,019,510
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 51
Collatz (3n + 1) trajectory
Steps to reach 1116the total stopping time
Highest value reached18,254,64415× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,201,951 → 3,605,854 → 1,802,927 → 5,408,782 → 2,704,391 → 8,113,174 → 4,056,587 → 12,169,762 → 6,084,881 → 18,254,644 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage120,195,100%
1,201,951% as a decimal12,019.51
1,201,951% of 1001,201,951
1,201,951% of 1,00012,019,510
As a fraction of 1001,201,951/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,951
Nerdulate something else
Nothing in mind? Surprise me · today’s page