Recognised as Number

1,250,670

Positive
Even
Composite
7 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,250,670

Digit count7

Digit sum21

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 5 × 47 × 887

Distinct prime factors52, 3, 5, 47, 887

Number of divisors32

Sum of divisors σ(n)3,068,928

Aliquot sum1,818,258sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)326,048integers below n that share no factor with it

Carmichael function λ(n)40,756the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 326,048

Möbius function μ(n)−15 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 5, 6, 10, 15, 30, 47, 94, 141, 235, 282, 470, 705, 887, 1,410, 1,774, 2,661, 4,435, 5,322, 8,870, 13,305, 26,610, 41,689, 83,378, 125,067, 208,445, 250,134, 416,890, 625,335, 1,250,67032 in total

Arithmetic

Previous number1,250,669

Next number1,250,671

Double2,501,340

Half625,335

Square1,564,175,448,900

Cube1,956,267,308,675,763,000

Square root1,118.333581719≈irrational, shown to 9 decimal places

Cube root107.740977347≈

Negation-1,250,670

Reciprocal7.9957143 × 10^-7≈

Representations

Decimal1,250,670

Binary10011000101010110111021 bits

Octal4612556

Hexadecimal13156E

Base 36QT0U

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, two hundred and fifty thousand, six hundred and seventy

Ordinalone million, two hundred and fifty thousand, six hundred and seventieth

Scientific notation1.25067 × 10^6

Engineering notation1.25067 × 10^6

In other bases

Ternary2100112121010base 3; the most digit-efficient integer base after e: 13 digits

Quinary310010140base 5; one hand: 9 digits

Septenary13426161base 7: 8 digits

Nonary2315533base 9; each digit is two ternary digits: 7 digits

Duodecimal503926base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal7g6dabase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal5:47:24:30base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T101TT0TT1010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary101110110101010110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000100110001010101101110

Bit length21 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits10within that length

Bit parityodd11 set bits, so odd; not the same as the number itself being even

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes313 15 6e

Gray code110101001111111011001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000100110001010101101110

64-bit0000000000000000000000000000000000000000000100110001010101101110

One's complement11111111111011001110101010010001at 32 bits, every bit flipped

Bits reversed01110110101010001100100000000000at 32 bits

Rotated left by 100000000001001100010101011011100at 32 bits, wrapping

Shifted left by 11001100010101011011100= 2,501,340, no wrap

Shifted right by 110011000101010110111= 625,335, discarding the low bit

These bits as a double6.17913081 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,250,677+7

Previous prime1,250,653−17

Distance to nearest prime7

Nearest square below1,249,924

Nearest square above1,252,161

Powers & multiples

1,250,670 to the power 21,564,175,448,900

1,250,670 to the power 31,956,267,308,675,763,000

1,250,670 to the power 42,446,644,834,941,516,511,210,000

1,250,670 to the power 53,059,945,295,716,306,455,075,010,700,000

First ten multiples1,250,670, 2,501,340, 3,752,010, 5,002,680, 6,253,350, 7,504,020, 8,754,690, 10,005,360, 11,256,030, 12,506,700

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6Yes

Divisible by 7No, remainder 1

Divisible by 8No, remainder 6

Divisible by 9No, remainder 3

Divisible by 10Yes

Divisible by 11No, remainder 3

Divisible by 12No, remainder 6

Divisible by 100No, remainder 70

Collatz (3n + 1) trajectory

Steps to reach 1111the total stopping time

Highest value reached4,221,0163× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,250,670 → 625,335 → 1,876,006 → 938,003 → 2,814,010 → 1,407,005 → 4,221,016 → 2,110,508 → 1,055,254 → 527,627 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage125,067,000%

1,250,670% as a decimal12,506.7

1,250,670% of 1001,250,670

1,250,670% of 1,00012,506,700

As a fraction of 1001,250,670/100

Read another way

As seconds14 days, 11 hours and 24 minutes

As bytes1.193 MiB

As a 24-bit colour#13156E

Keep nerding

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