Recognised as Number

4,668,432

Positive
Even
Composite
7 digits

4,668,432 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value4,668,432

Digit count7

Digit sum33

Digit product27,648

Multiplicative persistence7times 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^4 × 3 × 97,259

Distinct prime factors32, 3, 97,259

Number of divisors20

Sum of divisors σ(n)12,060,240

Aliquot sum7,391,808sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)194,516the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,556,128

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 97,259, 194,518, 291,777, 389,036, 583,554, 778,072, 1,167,108, 1,556,144, 2,334,216, 4,668,43220 in total

Arithmetic

Previous number4,668,431

Next number4,668,433

Double9,336,864

Half2,334,216

Square21,794,257,338,624

Cube101,745,008,375,867,117,568

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

Cube root167.131000276≈

Negation-4,668,432

Reciprocal2.14204684 × 10^-7≈

Representations

Decimal4,668,432

Binary1000111001111000001000023 bits

Octal21636020

Hexadecimal473C10

Base 362S26O

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

In wordsfour million, six hundred and sixty-eight thousand, four hundred and thirty-two

Ordinalfour million, six hundred and sixty-eight thousand, four hundred and thirty-second

Scientific notation4.668432 × 10^6

Engineering notation4.668432 × 10^6

In other bases

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

Quinary2143342212base 5; one hand: 10 digits

Septenary54452406base 7: 8 digits

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

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

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

Sexagesimal21:36:47:12base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000010001110011110000010000

Bit length23 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits14within that length

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

Highest set bitbit 22worth 4,194,304

Lowest set bitbit 44 trailing zeros

Power of twoNo

Bytes347 3c 10

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

At each machine width

32-bit00000000010001110011110000010000

64-bit0000000000000000000000000000000000000000010001110011110000010000

One's complement11111111101110001100001111101111at 32 bits, every bit flipped

Bits reversed00001000001111001110001000000000at 32 bits

Rotated left by 100000000100011100111100000100000at 32 bits, wrapping

Shifted left by 1100011100111100000100000= 9,336,864, no wrap

Shifted right by 11000111001111000001000= 2,334,216, discarding the low bit

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

Nearest landmarks

Next prime4,668,439+7

Previous prime4,668,431−1

Distance to nearest prime1

Nearest square below4,665,600

Nearest square above4,669,921

Powers & multiples

4,668,432 to the power 221,794,257,338,624

4,668,432 to the power 3101,745,008,375,867,117,568

4,668,432 to the power 4474,989,652,942,166,079,402,213,376

4,668,432 to the power 52,217,456,895,464,102,274,395,833,795,346,432

First ten multiples4,668,432, 9,336,864, 14,005,296, 18,673,728, 23,342,160, 28,010,592, 32,679,024, 37,347,456, 42,015,888, 46,684,320

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5No, remainder 2

Divisible by 6Yes

Divisible by 7No, remainder 6

Divisible by 8Yes

Divisible by 9No, remainder 6

Divisible by 10No, remainder 2

Divisible by 11No, remainder 10

Divisible by 12Yes

Divisible by 100No, remainder 32

Collatz (3n + 1) trajectory

Steps to reach 1255the total stopping time

Highest value reached4,668,432

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

First steps4,668,432 → 2,334,216 → 1,167,108 → 583,554 → 291,777 → 875,332 → 437,666 → 218,833 → 656,500 → 328,250 → …

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

As a percentage & fraction

As a percentage466,843,200%

4,668,432% as a decimal46,684.32

4,668,432% of 1004,668,432

4,668,432% of 1,00046,684,320

As a fraction of 1004,668,432/100

Read another way

As seconds54 days, 47 minutes and 12 seconds

As bytes4.452 MiB

As a 24-bit colour#473C10

Keep nerding

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