Recognised as Number
1,265,971
- Positive
- Odd
- Composite
- 7 digits
1,265,971 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,265,971
Digit count7
Digit sum31
Digit product3,780
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 223 × 811
Distinct prime factors37, 223, 811
Number of divisors8
Sum of divisors σ(n)1,455,104
Aliquot sum189,133sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,078,920integers below n that share no factor with it
Carmichael function λ(n)29,970the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,078,920
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 223, 811, 1,561, 5,677, 180,853, 1,265,9718 in total
Arithmetic
Previous number1,265,970
Next number1,265,972
Double2,531,942
Half632,985.5
Square1,602,682,572,841
Cube2,028,949,659,422,093,611
Square root1,125.153767269≈irrational, shown to 9 decimal places
Cube root108.178574028≈
Negation-1,265,971
Reciprocal7.8990751 × 10^-7≈
Representations
Decimal1,265,971
Binary10011010100010011001121 bits
Octal4650463
Hexadecimal135133
Base 36R4TV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and sixty-five thousand, nine hundred and seventy-one
Ordinalone million, two hundred and sixty-five thousand, nine hundred and seventy-first
Scientific notation1.265971 × 10^6
Engineering notation1.265971 × 10^6
In other bases
Ternary2101022120211base 3; the most digit-efficient integer base after e: 13 digits
Quinary311002341base 5; one hand: 9 digits
Septenary13521610base 7: 8 digits
Nonary2338524base 9; each digit is two ternary digits: 7 digits
Duodecimal510757base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7i4ibbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:51:39:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T101100TT1T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110101000101110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100110101000100110011
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
Bytes313 51 33
Gray code110101111100110101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100110101000100110011
64-bit0000000000000000000000000000000000000000000100110101000100110011
One's complement11111111111011001010111011001100at 32 bits, every bit flipped
Bits reversed11001100100010101100100000000000at 32 bits
Rotated left by 100000000001001101010001001100110at 32 bits, wrapping
Shifted left by 11001101010001001100110= 2,531,942, no wrap
Shifted right by 110011010100010011001= 632,985, discarding the low bit
These bits as a double6.2547278 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,265,971 to the power 21,602,682,572,841
1,265,971 to the power 32,028,949,659,422,093,611
1,265,971 to the power 42,568,591,429,288,247,270,811,281
1,265,971 to the power 53,251,762,260,327,471,685,676,228,218,851
First ten multiples1,265,971, 2,531,942, 3,797,913, 5,063,884, 6,329,855, 7,595,826, 8,861,797, 10,127,768, 11,393,739, 12,659,710
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 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1204the total stopping time
Highest value reached5,696,8724× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,265,971 → 3,797,914 → 1,898,957 → 5,696,872 → 2,848,436 → 1,424,218 → 712,109 → 2,136,328 → 1,068,164 → 534,082 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage126,597,100%
1,265,971% as a decimal12,659.71
1,265,971% of 1001,265,971
1,265,971% of 1,00012,659,710
As a fraction of 1001,265,971/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,265,971
Nerdulate something else
Nothing in mind? Surprise me · today’s page