Recognised as Number

1,247,370

Positive
Even
Composite
7 digits

1,247,370 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,247,370

Digit count7

Digit sum24

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation2 × 3 × 5 × 41,579

Distinct prime factors42, 3, 5, 41,579

Number of divisors16

Sum of divisors σ(n)2,993,760

Aliquot sum1,746,390sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)83,156the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 332,624

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 5, 6, 10, 15, 30, 41,579, 83,158, 124,737, 207,895, 249,474, 415,790, 623,685, 1,247,37016 in total

Arithmetic

Previous number1,247,369

Next number1,247,371

Double2,494,740

Half623,685

Square1,555,931,916,900

Cube1,940,822,795,183,553,000

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

Cube root107.646132612≈

Negation-1,247,370

Reciprocal8.01686749 × 10^-7≈

Representations

Decimal1,247,370

Binary10011000010001000101021 bits

Octal4604212

Hexadecimal13088A

Base 36QQH6

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

In wordsone million, two hundred and forty-seven thousand, three hundred and seventy

Ordinalone million, two hundred and forty-seven thousand, three hundred and seventieth

Scientific notation1.24737 × 10^6

Engineering notation1.24737 × 10^6

In other bases

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

Quinary304403440base 5; one hand: 9 digits

Septenary13413435base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100110000100010001010

Bit length21 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits14within that length

Bit parityodd7 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 08 8a

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

At each machine width

32-bit00000000000100110000100010001010

64-bit0000000000000000000000000000000000000000000100110000100010001010

One's complement11111111111011001111011101110101at 32 bits, every bit flipped

Bits reversed01010001000100001100100000000000at 32 bits

Rotated left by 100000000001001100001000100010100at 32 bits, wrapping

Shifted left by 11001100001000100010100= 2,494,740, no wrap

Shifted right by 110011000010001000101= 623,685, discarding the low bit

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

Nearest landmarks

Next prime1,247,371+1

Previous prime1,247,329−41

Distance to nearest prime1

Nearest square below1,245,456

Nearest square above1,247,689

Powers & multiples

1,247,370 to the power 21,555,931,916,900

1,247,370 to the power 31,940,822,795,183,553,000

1,247,370 to the power 42,420,924,130,028,108,505,610,000

1,247,370 to the power 53,019,788,132,073,161,706,642,745,700,000

First ten multiples1,247,370, 2,494,740, 3,742,110, 4,989,480, 6,236,850, 7,484,220, 8,731,590, 9,978,960, 11,226,330, 12,473,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 5

Divisible by 8No, remainder 2

Divisible by 9No, remainder 6

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 154the total stopping time

Highest value reached1,871,0561× the starting value

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

First steps1,247,370 → 623,685 → 1,871,056 → 935,528 → 467,764 → 233,882 → 116,941 → 350,824 → 175,412 → 87,706 → …

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

As a percentage & fraction

As a percentage124,737,000%

1,247,370% as a decimal12,473.7

1,247,370% of 1001,247,370

1,247,370% of 1,00012,473,700

As a fraction of 1001,247,370/100

Read another way

As seconds14 days, 10 hours and 29 minutes

As bytes1.19 MiB

As a 24-bit colour#13088A

Keep nerding

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