Recognised as Number

1,624,387

Positive
Odd
Prime
7 digits

1,624,387 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,624,387

Digit count7

Digit sum31

Digit product8,064

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,624,387

Distinct prime factors11,624,387

Number of divisors2

Sum of divisors σ(n)1,624,388

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,624,386the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 1,624,3872 in total

Arithmetic

Previous number1,624,386

Next number1,624,388

Double3,248,774

Half812,193.5

Square2,638,633,125,769

Cube4,286,161,347,268,528,603

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

Cube root117.551949264≈

Negation-1,624,387

Reciprocal6.15616845 × 10^-7≈

Representations

Decimal1,624,387

Binary11000110010010100001121 bits

Octal6144503

Hexadecimal18C943

Base 36YTDV

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

In wordsone million, six hundred and twenty-four thousand, three hundred and eighty-seven

Ordinalone million, six hundred and twenty-four thousand, three hundred and eighty-seventh

Scientific notation1.624387 × 10^6

Engineering notation1.624387 × 10^6

In other bases

Ternary10001112020111base 3; the most digit-efficient integer base after e: 14 digits

Quinary403440022base 5; one hand: 9 digits

Septenary16543552base 7: 8 digits

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

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

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

Sexagesimal7:31:13:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000110001100100101000011

Bit length21 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits12within that length

Bit parityodd9 set bits, so odd; 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

Bytes318 c9 43

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

At each machine width

32-bit00000000000110001100100101000011

64-bit0000000000000000000000000000000000000000000110001100100101000011

One's complement11111111111001110011011010111100at 32 bits, every bit flipped

Bits reversed11000010100100110001100000000000at 32 bits

Rotated left by 100000000001100011001001010000110at 32 bits, wrapping

Shifted left by 11100011001001010000110= 3,248,774, no wrap

Shifted right by 111000110010010100001= 812,193, discarding the low bit

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

Nearest landmarks

Next prime1,624,417+30

Previous prime1,624,373−14

Distance to nearest prime0, it is prime

Nearest square below1,623,076

Nearest square above1,625,625

Powers & multiples

1,624,387 to the power 22,638,633,125,769

1,624,387 to the power 34,286,161,347,268,528,603

1,624,387 to the power 46,962,384,772,405,483,371,841,361

1,624,387 to the power 511,309,607,313,293,425,917,935,272,870,707

First ten multiples1,624,387, 3,248,774, 4,873,161, 6,497,548, 8,121,935, 9,746,322, 11,370,709, 12,995,096, 14,619,483, 16,243,870

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 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 3

Divisible by 9No, remainder 4

Divisible by 10No, remainder 7

Divisible by 11No, remainder 6

Divisible by 12No, remainder 7

Divisible by 100No, remainder 87

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time

Highest value reached7,309,7444× the starting value

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

First steps1,624,387 → 4,873,162 → 2,436,581 → 7,309,744 → 3,654,872 → 1,827,436 → 913,718 → 456,859 → 1,370,578 → 685,289 → …

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

As a percentage & fraction

As a percentage162,438,700%

1,624,387% as a decimal16,243.87

1,624,387% of 1001,624,387

1,624,387% of 1,00016,243,870

As a fraction of 1001,624,387/100

Read another way

As seconds18 days, 19 hours and 13 minutes

As bytes1.549 MiB

As a 24-bit colour#18C943

Keep nerding

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