Recognised as Number

5,338,377

Positive
Odd
Composite
7 digits

5,338,377 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value5,338,377

Digit count7

Digit sum36

Digit product52,920

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 11 × 53,923

Distinct prime factors33, 11, 53,923

Number of divisors12

Sum of divisors σ(n)8,412,144

Aliquot sum3,073,767sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)3,235,320integers below n that share no factor with it

Carmichael function λ(n)269,610the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,235,320

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 11, 33, 99, 53,923, 161,769, 485,307, 593,153, 1,779,459, 5,338,37712 in total

Arithmetic

Previous number5,338,376

Next number5,338,378

Double10,676,754

Half2,669,188.5

Square28,498,268,994,129

Cube152,134,503,738,071,388,633

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

Cube root174.771151203≈

Negation-5,338,377

Reciprocal1.87322851 × 10^-7≈

Representations

Decimal5,338,377

Binary1010001011101010000100123 bits

Octal24272411

Hexadecimal517509

Base 3636F49

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

In wordsfive million, three hundred and thirty-eight thousand, three hundred and seventy-seven

Ordinalfive million, three hundred and thirty-eight thousand, three hundred and seventy-seventh

Scientific notation5.338377 × 10^6

Engineering notation5.338377 × 10^6

In other bases

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

Quinary2331312002base 5; one hand: 10 digits

Septenary63242532base 7: 8 digits

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

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

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

Sexagesimal24:42:52:57base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000010100010111010100001001

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

Bytes351 75 09

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

At each machine width

32-bit00000000010100010111010100001001

64-bit0000000000000000000000000000000000000000010100010111010100001001

One's complement11111111101011101000101011110110at 32 bits, every bit flipped

Bits reversed10010000101011101000101000000000at 32 bits

Rotated left by 100000000101000101110101000010010at 32 bits, wrapping

Shifted left by 1101000101110101000010010= 10,676,754, no wrap

Shifted right by 11010001011101010000100= 2,669,188, discarding the low bit

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

Nearest landmarks

Next prime5,338,393+16

Previous prime5,338,367−10

Distance to nearest prime10

Nearest square below5,336,100

Nearest square above5,340,721

Powers & multiples

5,338,377 to the power 228,498,268,994,129

5,338,377 to the power 3152,134,503,738,071,388,633

5,338,377 to the power 4812,151,335,661,734,325,436,468,641

5,338,377 to the power 54,335,570,010,815,882,303,020,559,154,335,657

First ten multiples5,338,377, 10,676,754, 16,015,131, 21,353,508, 26,691,885, 32,030,262, 37,368,639, 42,707,016, 48,045,393, 53,383,770

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 7

Divisible by 11Yes

Divisible by 12No, remainder 9

Divisible by 100No, remainder 77

Collatz (3n + 1) trajectory

Steps to reach 1100the total stopping time

Highest value reached27,025,5405× the starting value

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

First steps5,338,377 → 16,015,132 → 8,007,566 → 4,003,783 → 12,011,350 → 6,005,675 → 18,017,026 → 9,008,513 → 27,025,540 → 13,512,770 → …

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

As a percentage & fraction

As a percentage533,837,700%

5,338,377% as a decimal53,383.77

5,338,377% of 1005,338,377

5,338,377% of 1,00053,383,770

As a fraction of 1005,338,377/100

Read another way

As seconds61 days, 18 hours and 52 minutes

As bytes5.091 MiB

As a 24-bit colour#517509

Keep nerding

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