Recognised as Number

4,615,422

Positive
Even
Composite
7 digits

4,615,422 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 value4,615,422

Digit count7

Digit sum24

Digit product1,920

Multiplicative persistence2times 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 × 7 × 109,891

Distinct prime factors42, 3, 7, 109,891

Number of divisors16

Sum of divisors σ(n)10,549,632

Aliquot sum5,934,210sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)109,890the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,318,680

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 7, 14, 21, 42, 109,891, 219,782, 329,673, 659,346, 769,237, 1,538,474, 2,307,711, 4,615,42216 in total

Arithmetic

Previous number4,615,421

Next number4,615,423

Double9,230,844

Half2,307,711

Square21,302,120,238,084

Cube98,318,274,393,498,131,448

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

Cube root166.496000409≈

Negation-4,615,422

Reciprocal2.16664912 × 10^-7≈

Representations

Decimal4,615,422

Binary1000110011011001111111023 bits

Octal21466376

Hexadecimal466CFE

Base 362QXA6

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

In wordsfour million, six hundred and fifteen thousand, four hundred and twenty-two

Ordinalfour million, six hundred and fifteen thousand, four hundred and twenty-second

Scientific notation4.615422 × 10^6

Engineering notation4.615422 × 10^6

In other bases

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

Quinary2140143142base 5; one hand: 10 digits

Septenary54142020base 7: 8 digits

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

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

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

Sexagesimal21:22:3:42base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000010001100110110011111110

Bit length23 bitsto write the magnitude

Set bits14the population count, or Hamming weight

Zero bits9within that length

Bit parityeven14 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

Bytes346 6c fe

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

At each machine width

32-bit00000000010001100110110011111110

64-bit0000000000000000000000000000000000000000010001100110110011111110

One's complement11111111101110011001001100000001at 32 bits, every bit flipped

Bits reversed01111111001101100110001000000000at 32 bits

Rotated left by 100000000100011001101100111111100at 32 bits, wrapping

Shifted left by 1100011001101100111111100= 9,230,844, no wrap

Shifted right by 11000110011011001111111= 2,307,711, discarding the low bit

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

Nearest landmarks

Next prime4,615,439+17

Previous prime4,615,409−13

Distance to nearest prime13

Nearest square below4,613,904

Nearest square above4,618,201

Powers & multiples

4,615,422 to the power 221,302,120,238,084

4,615,422 to the power 398,318,274,393,498,131,448

4,615,422 to the power 4453,780,326,637,787,932,843,991,056

4,615,422 to the power 52,094,387,702,731,232,456,582,678,887,665,632

First ten multiples4,615,422, 9,230,844, 13,846,266, 18,461,688, 23,077,110, 27,692,532, 32,307,954, 36,923,376, 41,538,798, 46,154,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 7Yes

Divisible by 8No, remainder 6

Divisible by 9No, remainder 6

Divisible by 10No, remainder 2

Divisible by 11No, remainder 9

Divisible by 12No, remainder 6

Divisible by 100No, remainder 22

Collatz (3n + 1) trajectory

Steps to reach 1180the total stopping time

Highest value reached133,074,30428× the starting value

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

First steps4,615,422 → 2,307,711 → 6,923,134 → 3,461,567 → 10,384,702 → 5,192,351 → 15,577,054 → 7,788,527 → 23,365,582 → 11,682,791 → …

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

As a percentage & fraction

As a percentage461,542,200%

4,615,422% as a decimal46,154.22

4,615,422% of 1004,615,422

4,615,422% of 1,00046,154,220

As a fraction of 1004,615,422/100

Read another way

As seconds53 days, 10 hours and 3 minutes

As bytes4.402 MiB

As a 24-bit colour#466CFE

Keep nerding

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