Recognised as Number

4,870,722

Positive
Even
Composite
7 digits

4,870,722 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value4,870,722

Digit count7

Digit sum30

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 × 167 × 4,861

Distinct prime factors42, 3, 167, 4,861

Number of divisors16

Sum of divisors σ(n)9,801,792

Aliquot sum4,931,070sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)403,380the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,613,520

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 167, 334, 501, 1,002, 4,861, 9,722, 14,583, 29,166, 811,787, 1,623,574, 2,435,361, 4,870,72216 in total

Arithmetic

Previous number4,870,721

Next number4,870,723

Double9,741,444

Half2,435,361

Square23,723,932,801,284

Cube115,552,681,421,735,607,048

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

Cube root169.510958994≈

Negation-4,870,722

Reciprocal2.05308371 × 10^-7≈

Representations

Decimal4,870,722

Binary1001010010100100100001023 bits

Octal22451102

Hexadecimal4A5242

Base 362WE9U

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

In wordsfour million, eight hundred and seventy thousand, seven hundred and twenty-two

Ordinalfour million, eight hundred and seventy thousand, seven hundred and twenty-second

Scientific notation4.870722 × 10^6

Engineering notation4.870722 × 10^6

In other bases

Ternary100011110101010base 3; the most digit-efficient integer base after e: 15 digits

Quinary2221330342base 5; one hand: 10 digits

Septenary56254233base 7: 8 digits

Nonary10143333base 9; each digit is two ternary digits: 8 digits

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

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

Sexagesimal22:32:58:42base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000010010100101001001000010

Bit length23 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits15within that length

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

Highest set bitbit 22worth 4,194,304

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes34a 52 42

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

At each machine width

32-bit00000000010010100101001001000010

64-bit0000000000000000000000000000000000000000010010100101001001000010

One's complement11111111101101011010110110111101at 32 bits, every bit flipped

Bits reversed01000010010010100101001000000000at 32 bits

Rotated left by 100000000100101001010010010000100at 32 bits, wrapping

Shifted left by 1100101001010010010000100= 9,741,444, no wrap

Shifted right by 11001010010100100100001= 2,435,361, discarding the low bit

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

Nearest landmarks

Next prime4,870,729+7

Previous prime4,870,709−13

Distance to nearest prime7

Nearest square below4,866,436

Nearest square above4,870,849

Powers & multiples

4,870,722 to the power 223,723,932,801,284

4,870,722 to the power 3115,552,681,421,735,607,048

4,870,722 to the power 4562,824,987,559,838,899,432,048,656

4,870,722 to the power 52,741,364,049,057,433,643,919,466,893,849,632

First ten multiples4,870,722, 9,741,444, 14,612,166, 19,482,888, 24,353,610, 29,224,332, 34,095,054, 38,965,776, 43,836,498, 48,707,220

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6Yes

Divisible by 7No, remainder 3

Divisible by 8No, remainder 2

Divisible by 9No, remainder 3

Divisible by 10No, remainder 2

Divisible by 11No, remainder 10

Divisible by 12No, remainder 6

Divisible by 100No, remainder 22

Collatz (3n + 1) trajectory

Steps to reach 1206the total stopping time

Highest value reached7,306,0841× the starting value

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

First steps4,870,722 → 2,435,361 → 7,306,084 → 3,653,042 → 1,826,521 → 5,479,564 → 2,739,782 → 1,369,891 → 4,109,674 → 2,054,837 → …

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

As a percentage & fraction

As a percentage487,072,200%

4,870,722% as a decimal48,707.22

4,870,722% of 1004,870,722

4,870,722% of 1,00048,707,220

As a fraction of 1004,870,722/100

Read another way

As seconds56 days, 8 hours and 58 minutes

As bytes4.645 MiB

As a 24-bit colour#4A5242

Keep nerding

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