Nerdulator> put something in

Recognised as Number

1,027,250

  • Positive
  • Even
  • Composite
  • 7 digits

1,027,250 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,027,250
Digit count7
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5^3 × 7 × 587
Distinct prime factors42, 5, 7, 587
Number of divisors32
Sum of divisors σ(n)2,201,472
Aliquot sum1,174,222sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)351,600integers below n that share no factor with it
Carmichael function λ(n)87,900the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 351,600
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 5, 7, 10, 14, 25, 35, 50, 70, 125, 175, 250, 350, 587, 875, 1,174, 1,750, 2,935, 4,109, 5,870, 8,218, 14,675, 20,545, 29,350, 41,090, 73,375, 102,725, 146,750, 205,450, 513,625, 1,027,25032 in total

Arithmetic

Previous number1,027,249
Next number1,027,251
Double2,054,500
Cube1,083,997,922,328,125,000
Square root1,013.533423228≈irrational, shown to 9 decimal places
Cube root100.900205321≈
Negation-1,027,250
Reciprocal9.73472864 × 10^-7≈

Representations

Decimal1,027,250
Binary1111101011001011001020 bits
Octal3726262
HexadecimalFACB2
Base 36M0MQ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, twenty-seven thousand, two hundred and fifty
Ordinalone million, twenty-seven thousand, two hundred and fiftieth
Scientific notation1.02725 × 10^6
Engineering notation1.02725 × 10^6

In other bases

Ternary1221012010022base 3; the most digit-efficient integer base after e: 13 digits
Quinary230333000base 5; one hand: 9 digits
Septenary11505620base 7: 8 digits
Nonary1835108base 9; each digit is two ternary digits: 7 digits
Duodecimal416582base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6882abase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:45:20:50base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T11TT01010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001111110111110110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000011111010110010110010
Bit length20 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits8within that length
Bit parityeven12 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 b2
Gray code10000111101011101011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000011111010110010110010
64-bit0000000000000000000000000000000000000000000011111010110010110010
One's complement11111111111100000101001101001101at 32 bits, every bit flipped
Bits reversed01001101001101011111000000000000at 32 bits
Rotated left by 100000000000111110101100101100100at 32 bits, wrapping
Shifted left by 1111110101100101100100= 2,054,500, no wrap
Shifted right by 11111101011001011001= 513,625, discarding the low bit
These bits as a double5.07528935 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,027,261+11
Previous prime1,027,241−9
Distance to nearest prime9
Nearest square below1,026,169
Nearest square above1,028,196

Powers & multiples

1,027,250 to the power 21,055,242,562,500
1,027,250 to the power 31,083,997,922,328,125,000
1,027,250 to the power 41,113,536,865,711,566,406,250,000
1,027,250 to the power 51,143,880,745,302,206,590,820,312,500,000
First ten multiples1,027,250, 2,054,500, 3,081,750, 4,109,000, 5,136,250, 6,163,500, 7,190,750, 8,218,000, 9,245,250, 10,272,500
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 5Yes
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9No, remainder 8
Divisible by 10Yes
Divisible by 11No, remainder 4
Divisible by 12No, remainder 2
Divisible by 100No, remainder 50

Collatz (3n + 1) trajectory

Steps to reach 1103the total stopping time
Highest value reached1,733,4881× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,027,250 → 513,625 → 1,540,876 → 770,438 → 385,219 → 1,155,658 → 577,829 → 1,733,488 → 866,744 → 433,372 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage102,725,000%
1,027,250% as a decimal10,272.5
1,027,250% of 1001,027,250
1,027,250% of 1,00010,272,500
As a fraction of 1001,027,250/100

Read another way

As a 24-bit colour#0FACB2

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “1027250” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.