Recognised as Number
1,263,471
- Positive
- Odd
- Composite
- 7 digits
1,263,471 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,263,471
Digit count7
Digit sum24
Digit product1,008
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 11 × 38,287
Distinct prime factors33, 11, 38,287
Number of divisors8
Sum of divisors σ(n)1,837,824
Aliquot sum574,353sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)765,720integers below n that share no factor with it
Carmichael function λ(n)191,430the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 765,720
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 11, 33, 38,287, 114,861, 421,157, 1,263,4718 in total
Arithmetic
Previous number1,263,470
Next number1,263,472
Double2,526,942
Half631,735.5
Square1,596,358,967,841
Cube2,016,953,261,457,036,111
Square root1,124.042258992≈irrational, shown to 9 decimal places
Cube root108.107317879≈
Negation-1,263,471
Reciprocal7.91470481 × 10^-7≈
Representations
Decimal1,263,471
Binary10011010001110110111121 bits
Octal4643557
Hexadecimal13476F
Base 36R2WF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and sixty-three thousand, four hundred and seventy-one
Ordinalone million, two hundred and sixty-three thousand, four hundred and seventy-first
Scientific notation1.263471 × 10^6
Engineering notation1.263471 × 10^6
In other bases
Ternary2101012011020base 3; the most digit-efficient integer base after e: 13 digits
Quinary310412341base 5; one hand: 9 digits
Septenary13511406base 7: 8 digits
Nonary2335136base 9; each digit is two ternary digits: 7 digits
Duodecimal50b213base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7hidbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:50:57:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1011TT0111T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110101100010110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100110100011101101111
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 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
Bytes313 47 6f
Gray code110101110010011011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100110100011101101111
64-bit0000000000000000000000000000000000000000000100110100011101101111
One's complement11111111111011001011100010010000at 32 bits, every bit flipped
Bits reversed11110110111000101100100000000000at 32 bits
Rotated left by 100000000001001101000111011011110at 32 bits, wrapping
Shifted left by 11001101000111011011110= 2,526,942, no wrap
Shifted right by 110011010001110110111= 631,735, discarding the low bit
These bits as a double6.24237616 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,263,471 to the power 21,596,358,967,841
1,263,471 to the power 32,016,953,261,457,036,111
1,263,471 to the power 42,548,361,954,206,382,872,201,281
1,263,471 to the power 53,219,781,426,643,092,773,923,024,706,351
First ten multiples1,263,471, 2,526,942, 3,790,413, 5,053,884, 6,317,355, 7,580,826, 8,844,297, 10,107,768, 11,371,239, 12,634,710
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1155the total stopping time
Highest value reached14,391,73611× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,263,471 → 3,790,414 → 1,895,207 → 5,685,622 → 2,842,811 → 8,528,434 → 4,264,217 → 12,792,652 → 6,396,326 → 3,198,163 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage126,347,100%
1,263,471% as a decimal12,634.71
1,263,471% of 1001,263,471
1,263,471% of 1,00012,634,710
As a fraction of 1001,263,471/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,263,471
Nerdulate something else
Nothing in mind? Surprise me · today’s page