Recognised as Number
1,027,261
- Positive
- Odd
- Prime
- 7 digits
1,027,261 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,027,261
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 factorisation1,027,261
Distinct prime factors11,027,261
Number of divisors2
Sum of divisors σ(n)1,027,262
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,027,260integers below n that share no factor with it
Carmichael function λ(n)1,027,260the 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,027,2612 in total
Arithmetic
Previous number1,027,260
Next number1,027,262
Double2,054,522
Half513,630.5
Square1,055,265,162,121
Cube1,084,032,745,705,580,581
Square root1,013.538849773≈irrational, shown to 9 decimal places
Cube root100.900565472≈
Negation-1,027,261
Reciprocal9.7346244 × 10^-7≈
Representations
Decimal1,027,261
Binary1111101011001011110120 bits
Octal3726275
HexadecimalFACBD
Base 36M0N1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, twenty-seven thousand, two hundred and sixty-one
Ordinalone million, twenty-seven thousand, two hundred and sixty-first
Scientific notation1.027261 × 10^6
Engineering notation1.027261 × 10^6
In other bases
Ternary1221012010201base 3; the most digit-efficient integer base after e: 13 digits
Quinary230333021base 5; one hand: 9 digits
Septenary11505634base 7: 8 digits
Nonary1835121base 9; each digit is two ternary digits: 7 digits
Duodecimal416591base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal68831base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:45:21:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T11TT011T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001111110111001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011111010110010111101
Bit length20 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits6within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 19worth 524,288
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes30f ac bd
Gray code10000111101011100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011111010110010111101
64-bit0000000000000000000000000000000000000000000011111010110010111101
One's complement11111111111100000101001101000010at 32 bits, every bit flipped
Bits reversed10111101001101011111000000000000at 32 bits
Rotated left by 100000000000111110101100101111010at 32 bits, wrapping
Shifted left by 1111110101100101111010= 2,054,522, no wrap
Shifted right by 11111101011001011110= 513,630, discarding the low bit
These bits as a double5.07534369 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,027,261 to the power 21,055,265,162,121
1,027,261 to the power 31,084,032,745,705,580,581
1,027,261 to the power 41,113,584,562,386,260,413,218,641
1,027,261 to the power 51,143,941,991,141,472,258,343,394,372,301
First ten multiples1,027,261, 2,054,522, 3,081,783, 4,109,044, 5,136,305, 6,163,566, 7,190,827, 8,218,088, 9,245,349, 10,272,610
Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1196the total stopping time
Highest value reached18,999,01618× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,027,261 → 3,081,784 → 1,540,892 → 770,446 → 385,223 → 1,155,670 → 577,835 → 1,733,506 → 866,753 → 2,600,260 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage102,726,100%
1,027,261% as a decimal10,272.61
1,027,261% of 1001,027,261
1,027,261% of 1,00010,272,610
As a fraction of 1001,027,261/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,027,261
Nerdulate something else
Nothing in mind? Surprise me · today’s page