Recognised as Number

4,391,771

Positive
Odd
Prime
7 digits

4,391,771 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value4,391,771

Digit count7

Digit sum32

Digit product5,292

Multiplicative persistence3times the digit product can be taken before one digit is left

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation4,391,771

Distinct prime factors14,391,771

Number of divisors2

Sum of divisors σ(n)4,391,772

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)4,391,770integers below n that share no factor with it

Carmichael function λ(n)4,391,770the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 4,391,7712 in total

Arithmetic

Previous number4,391,770

Next number4,391,772

Double8,783,542

Half2,195,885.5

Square19,287,652,516,441

Cube84,706,952,979,782,607,011

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

Cube root163.762035904≈

Negation-4,391,771

Reciprocal2.27698575 × 10^-7≈

Representations

Decimal4,391,771

Binary1000011000000110101101123 bits

Octal20601533

Hexadecimal43035B

Base 362M4PN

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

In wordsfour million, three hundred and ninety-one thousand, seven hundred and seventy-one

Ordinalfour million, three hundred and ninety-one thousand, seven hundred and seventy-first

Scientific notation4.391771 × 10^6

Engineering notation4.391771 × 10^6

In other bases

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

Quinary2111014041base 5; one hand: 10 digits

Septenary52220666base 7: 8 digits

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

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

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

Sexagesimal20:19:56:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000010000110000001101011011

Bit length23 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits13within that length

Bit parityeven10 set bits, so even; 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

Bytes343 03 5b

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

At each machine width

32-bit00000000010000110000001101011011

64-bit0000000000000000000000000000000000000000010000110000001101011011

One's complement11111111101111001111110010100100at 32 bits, every bit flipped

Bits reversed11011010110000001100001000000000at 32 bits

Rotated left by 100000000100001100000011010110110at 32 bits, wrapping

Shifted left by 1100001100000011010110110= 8,783,542, no wrap

Shifted right by 11000011000000110101101= 2,195,885, discarding the low bit

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

Nearest landmarks

Next prime4,391,773+2

Previous prime4,391,767−4

Distance to nearest prime0, it is prime

Nearest square below4,389,025

Nearest square above4,393,216

Powers & multiples

4,391,771 to the power 219,287,652,516,441

4,391,771 to the power 384,706,952,979,782,607,011

4,391,771 to the power 4372,013,539,594,972,839,775,306,481

4,391,771 to the power 51,633,798,274,800,553,463,512,837,519,367,851

First ten multiples4,391,771, 8,783,542, 13,175,313, 17,567,084, 21,958,855, 26,350,626, 30,742,397, 35,134,168, 39,525,939, 43,917,710

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 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 6

Divisible by 8No, remainder 3

Divisible by 9No, remainder 5

Divisible by 10No, remainder 1

Divisible by 11No, remainder 10

Divisible by 12No, remainder 11

Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 1123the total stopping time

Highest value reached33,350,0207× the starting value

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

First steps4,391,771 → 13,175,314 → 6,587,657 → 19,762,972 → 9,881,486 → 4,940,743 → 14,822,230 → 7,411,115 → 22,233,346 → 11,116,673 → …

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

As a percentage & fraction

As a percentage439,177,100%

4,391,771% as a decimal43,917.71

4,391,771% of 1004,391,771

4,391,771% of 1,00043,917,710

As a fraction of 1004,391,771/100

Read another way

As seconds50 days, 19 hours and 56 minutes

As bytes4.188 MiB

As a 24-bit colour#43035B

Keep nerding

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