Recognised as Number

4,287,199

Positive
Odd
Composite
7 digits

4,287,199 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value4,287,199

Digit count7

Digit sum40

Digit product36,288

Multiplicative persistence3times 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 factorisation7 × 47 × 83 × 157

Distinct prime factors47, 47, 83, 157

Number of divisors16

Sum of divisors σ(n)5,096,448

Aliquot sum809,249sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)3,530,592integers below n that share no factor with it

Carmichael function λ(n)147,108the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,530,592

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 47, 83, 157, 329, 581, 1,099, 3,901, 7,379, 13,031, 27,307, 51,653, 91,217, 612,457, 4,287,19916 in total

Arithmetic

Previous number4,287,198

Next number4,287,200

Double8,574,398

Half2,143,599.5

Square18,380,075,265,601

Cube78,799,040,298,609,341,599

Square root2,070.555239543≈irrational, shown to 9 decimal places

Cube root162.451807405≈

Negation-4,287,199

Reciprocal2.33252527 × 10^-7≈

Representations

Decimal4,287,199

Binary1000001011010101101111123 bits

Octal20265337

Hexadecimal416ADF

Base 362JW0V

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

In wordsfour million, two hundred and eighty-seven thousand, one hundred and ninety-nine

Ordinalfour million, two hundred and eighty-seven thousand, one hundred and ninety-ninth

Scientific notation4.287199 × 10^6

Engineering notation4.287199 × 10^6

In other bases

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

Quinary2044142244base 5; one hand: 10 digits

Septenary51304060base 7: 8 digits

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

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

Vigesimal16fhjjbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal19:50:53:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000010000010110101011011111

Bit length23 bitsto write the magnitude

Set bits13the population count, or Hamming weight

Zero bits10within that length

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

Highest set bitbit 22worth 4,194,304

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes341 6a df

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

At each machine width

32-bit00000000010000010110101011011111

64-bit0000000000000000000000000000000000000000010000010110101011011111

One's complement11111111101111101001010100100000at 32 bits, every bit flipped

Bits reversed11111011010101101000001000000000at 32 bits

Rotated left by 100000000100000101101010110111110at 32 bits, wrapping

Shifted left by 1100000101101010110111110= 8,574,398, no wrap

Shifted right by 11000001011010101101111= 2,143,599, discarding the low bit

These bits as a double2.11815774 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,287,209+10

Previous prime4,287,197−2

Distance to nearest prime2

Nearest square below4,284,900

Nearest square above4,289,041

Powers & multiples

4,287,199 to the power 218,380,075,265,601

4,287,199 to the power 378,799,040,298,609,341,599

4,287,199 to the power 4337,827,166,769,157,670,693,891,201

4,287,199 to the power 51,448,332,291,545,565,996,641,179,663,035,999

First ten multiples4,287,199, 8,574,398, 12,861,597, 17,148,796, 21,435,995, 25,723,194, 30,010,393, 34,297,592, 38,584,791, 42,871,990

Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 9

Divisible by 11No, remainder 4

Divisible by 12No, remainder 7

Divisible by 100No, remainder 99

Collatz (3n + 1) trajectory

Steps to reach 1180the total stopping time

Highest value reached65,111,84815× the starting value

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

First steps4,287,199 → 12,861,598 → 6,430,799 → 19,292,398 → 9,646,199 → 28,938,598 → 14,469,299 → 43,407,898 → 21,703,949 → 65,111,848 → …

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

As a percentage & fraction

As a percentage428,719,900%

4,287,199% as a decimal42,871.99

4,287,199% of 1004,287,199

4,287,199% of 1,00042,871,990

As a fraction of 1004,287,199/100

Read another way

As seconds49 days, 14 hours and 53 minutes

As bytes4.089 MiB

As a 24-bit colour#416ADF

Keep nerding

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