Recognised as Number

1,240,651

Positive
Odd
Composite
7 digits

1,240,651 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,240,651

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 factorisation31^2 × 1,291

Distinct prime factors231, 1,291

Number of divisors6

Sum of divisors σ(n)1,282,956

Aliquot sum42,305sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,199,700integers below n that share no factor with it

Carmichael function λ(n)39,990the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,199,700

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 31, 961, 1,291, 40,021, 1,240,6516 in total

Arithmetic

Previous number1,240,650

Next number1,240,652

Double2,481,302

Half620,325.5

Square1,539,214,903,801

Cube1,909,628,509,615,614,451

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

Cube root107.452504708≈

Negation-1,240,651

Reciprocal8.06028448 × 10^-7≈

Representations

Decimal1,240,651

Binary10010111011100100101121 bits

Octal4567113

Hexadecimal12EE4B

Base 36QLAJ

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

In wordsone million, two hundred and forty thousand, six hundred and fifty-one

Ordinalone million, two hundred and forty thousand, six hundred and fifty-first

Scientific notation1.240651 × 10^6

Engineering notation1.240651 × 10^6

In other bases

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

Quinary304200101base 5; one hand: 9 digits

Septenary13355026base 7: 8 digits

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

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

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

Sexagesimal5:44:37:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100101110111001001011

Bit length21 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits9within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes312 ee 4b

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

At each machine width

32-bit00000000000100101110111001001011

64-bit0000000000000000000000000000000000000000000100101110111001001011

One's complement11111111111011010001000110110100at 32 bits, every bit flipped

Bits reversed11010010011101110100100000000000at 32 bits

Rotated left by 100000000001001011101110010010110at 32 bits, wrapping

Shifted left by 11001011101110010010110= 2,481,302, no wrap

Shifted right by 110010111011100100101= 620,325, discarding the low bit

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

Nearest landmarks

Next prime1,240,667+16

Previous prime1,240,637−14

Distance to nearest prime14

Nearest square below1,238,769

Nearest square above1,240,996

Powers & multiples

1,240,651 to the power 21,539,214,903,801

1,240,651 to the power 31,909,628,509,615,614,451

1,240,651 to the power 42,369,182,520,083,121,684,247,601

1,240,651 to the power 52,939,328,662,723,645,000,683,470,428,251

First ten multiples1,240,651, 2,481,302, 3,721,953, 4,962,604, 6,203,255, 7,443,906, 8,684,557, 9,925,208, 11,165,859, 12,406,510

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 6

Divisible by 8No, remainder 3

Divisible by 9No, remainder 1

Divisible by 10No, remainder 1

Divisible by 11No, remainder 5

Divisible by 12No, remainder 7

Divisible by 100No, remainder 51

Collatz (3n + 1) trajectory

Steps to reach 1142the total stopping time

Highest value reached5,582,9324× the starting value

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

First steps1,240,651 → 3,721,954 → 1,860,977 → 5,582,932 → 2,791,466 → 1,395,733 → 4,187,200 → 2,093,600 → 1,046,800 → 523,400 → …

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

As a percentage & fraction

As a percentage124,065,100%

1,240,651% as a decimal12,406.51

1,240,651% of 1001,240,651

1,240,651% of 1,00012,406,510

As a fraction of 1001,240,651/100

Read another way

As seconds14 days, 8 hours and 37 minutes

As bytes1.183 MiB

As a 24-bit colour#12EE4B

Keep nerding

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