Recognised as Number

4,155,664

Positive
Even
Composite
7 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value4,155,664

Digit count7

Digit sum31

Digit product14,400

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 factorisation2^4 × 179 × 1,451

Distinct prime factors32, 179, 1,451

Number of divisors20

Sum of divisors σ(n)8,102,160

Aliquot sum3,946,496sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)2,064,800integers below n that share no factor with it

Carmichael function λ(n)258,100the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,064,800

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 179, 358, 716, 1,432, 1,451, 2,864, 2,902, 5,804, 11,608, 23,216, 259,729, 519,458, 1,038,916, 2,077,832, 4,155,66420 in total

Arithmetic

Previous number4,155,663

Next number4,155,665

Double8,311,328

Half2,077,832

Square17,269,543,280,896

Cube71,766,419,308,861,394,944

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

Cube root160.77313314≈

Negation-4,155,664

Reciprocal2.40635432 × 10^-7≈

Representations

Decimal4,155,664

Binary111111011010010001000022 bits

Octal17664420

Hexadecimal3F6910

Base 362H2J4

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

In wordsfour million, one hundred and fifty-five thousand, six hundred and sixty-four

Ordinalfour million, one hundred and fifty-five thousand, six hundred and sixty-fourth

Scientific notation4.155664 × 10^6

Engineering notation4.155664 × 10^6

In other bases

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

Quinary2030440124base 5; one hand: 10 digits

Septenary50215432base 7: 8 digits

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

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

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

Sexagesimal19:14:21:4base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001111110110100100010000

Bit length22 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits11within that length

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

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 44 trailing zeros

Power of twoNo

Bytes33f 69 10

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

At each machine width

32-bit00000000001111110110100100010000

64-bit0000000000000000000000000000000000000000001111110110100100010000

One's complement11111111110000001001011011101111at 32 bits, every bit flipped

Bits reversed00001000100101101111110000000000at 32 bits

Rotated left by 100000000011111101101001000100000at 32 bits, wrapping

Shifted left by 111111101101001000100000= 8,311,328, no wrap

Shifted right by 1111111011010010001000= 2,077,832, discarding the low bit

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

Nearest landmarks

Next prime4,155,673+9

Previous prime4,155,659−5

Distance to nearest prime5

Nearest square below4,153,444

Nearest square above4,157,521

Powers & multiples

4,155,664 to the power 217,269,543,280,896

4,155,664 to the power 371,766,419,308,861,394,944

4,155,664 to the power 4298,237,125,130,740,179,958,562,816

4,155,664 to the power 51,239,373,284,369,312,259,207,320,986,189,824

First ten multiples4,155,664, 8,311,328, 12,466,992, 16,622,656, 20,778,320, 24,933,984, 29,089,648, 33,245,312, 37,400,976, 41,556,640

Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6No, remainder 4

Divisible by 7No, remainder 2

Divisible by 8Yes

Divisible by 9No, remainder 4

Divisible by 10No, remainder 4

Divisible by 11No, remainder 7

Divisible by 12No, remainder 4

Divisible by 100No, remainder 64

Collatz (3n + 1) trajectory

Steps to reach 1167the total stopping time

Highest value reached4,155,664

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

First steps4,155,664 → 2,077,832 → 1,038,916 → 519,458 → 259,729 → 779,188 → 389,594 → 194,797 → 584,392 → 292,196 → …

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

As a percentage & fraction

As a percentage415,566,400%

4,155,664% as a decimal41,556.64

4,155,664% of 1004,155,664

4,155,664% of 1,00041,556,640

As a fraction of 1004,155,664/100

Read another way

As seconds48 days, 2 hours and 21 minutes

As bytes3.963 MiB

As a 24-bit colour#3F6910

Keep nerding

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