Recognised as Number
1,027,262
- Positive
- Even
- Composite
- 7 digits
1,027,262 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,027,262
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 factorisation2 × 513,631
Distinct prime factors22, 513,631
Number of divisors4
Sum of divisors σ(n)1,540,896
Aliquot sum513,634sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)513,630integers below n that share no factor with it
Carmichael function λ(n)513,630the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 513,631, 1,027,2624 in total
Arithmetic
Previous number1,027,261
Next number1,027,263
Double2,054,524
Half513,631
Square1,055,267,216,644
Cube1,084,035,911,504,148,728
Square root1,013.539343094≈irrational, shown to 9 decimal places
Cube root100.900598213≈
Negation-1,027,262
Reciprocal9.73461493 × 10^-7≈
Representations
Decimal1,027,262
Binary1111101011001011111020 bits
Octal3726276
HexadecimalFACBE
Base 36M0N2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, twenty-seven thousand, two hundred and sixty-two
Ordinalone million, twenty-seven thousand, two hundred and sixty-second
Scientific notation1.027262 × 10^6
Engineering notation1.027262 × 10^6
In other bases
Ternary1221012010202base 3; the most digit-efficient integer base after e: 13 digits
Quinary230333022base 5; one hand: 9 digits
Septenary11505635base 7: 8 digits
Nonary1835122base 9; each digit is two ternary digits: 7 digits
Duodecimal416592base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal68832base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:45:21:2base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T11TT011T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001111110111000010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011111010110010111110
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 even
Highest set bitbit 19worth 524,288
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes30f ac be
Gray code10000111101011100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011111010110010111110
64-bit0000000000000000000000000000000000000000000011111010110010111110
One's complement11111111111100000101001101000001at 32 bits, every bit flipped
Bits reversed01111101001101011111000000000000at 32 bits
Rotated left by 100000000000111110101100101111100at 32 bits, wrapping
Shifted left by 1111110101100101111100= 2,054,524, no wrap
Shifted right by 11111101011001011111= 513,631, discarding the low bit
These bits as a double5.07534863 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,027,262 to the power 21,055,267,216,644
1,027,262 to the power 31,084,035,911,504,148,728
1,027,262 to the power 41,113,588,898,523,574,830,622,736
1,027,262 to the power 51,143,947,559,075,124,527,655,173,028,832
First ten multiples1,027,262, 2,054,524, 3,081,786, 4,109,048, 5,136,310, 6,163,572, 7,190,834, 8,218,096, 9,245,358, 10,272,620
Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 5
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 5
Divisible by 12No, remainder 2
Divisible by 100No, remainder 62
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,262 → 513,631 → 1,540,894 → 770,447 → 2,311,342 → 1,155,671 → 3,467,014 → 1,733,507 → 5,200,522 → 2,600,261 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage102,726,200%
1,027,262% as a decimal10,272.62
1,027,262% of 1001,027,262
1,027,262% of 1,00010,272,620
As a fraction of 1001,027,262/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,262
Nerdulate something else
Nothing in mind? Surprise me · today’s page