Recognised as Number

5,385,489

Positive
Odd
Composite
7 digits

5,385,489 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value5,385,489

Digit count7

Digit sum42

Digit product172,800

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 factorisation3 × 53 × 33,871

Distinct prime factors33, 53, 33,871

Number of divisors8

Sum of divisors σ(n)7,316,352

Aliquot sum1,930,863sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)880,620the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,522,480

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 53, 159, 33,871, 101,613, 1,795,163, 5,385,4898 in total

Arithmetic

Previous number5,385,488

Next number5,385,490

Double10,770,978

Half2,692,744.5

Square29,003,491,769,121

Cube156,197,985,884,191,685,169

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

Cube root175.283773608≈

Negation-5,385,489

Reciprocal1.8568416 × 10^-7≈

Representations

Decimal5,385,489

Binary1010010001011010001000123 bits

Octal24426421

Hexadecimal522D11

Base 3637FGX

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

In wordsfive million, three hundred and eighty-five thousand, four hundred and eighty-nine

Ordinalfive million, three hundred and eighty-five thousand, four hundred and eighty-ninth

Scientific notation5.385489 × 10^6

Engineering notation5.385489 × 10^6

In other bases

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

Quinary2334313424base 5; one hand: 10 digits

Septenary63530064base 7: 8 digits

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

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

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

Sexagesimal24:55:58:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000010100100010110100010001

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 odd

Highest set bitbit 22worth 4,194,304

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes352 2d 11

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

At each machine width

32-bit00000000010100100010110100010001

64-bit0000000000000000000000000000000000000000010100100010110100010001

One's complement11111111101011011101001011101110at 32 bits, every bit flipped

Bits reversed10001000101101000100101000000000at 32 bits

Rotated left by 100000000101001000101101000100010at 32 bits, wrapping

Shifted left by 1101001000101101000100010= 10,770,978, no wrap

Shifted right by 11010010001011010001000= 2,692,744, discarding the low bit

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

Nearest landmarks

Next prime5,385,511+22

Previous prime5,385,487−2

Distance to nearest prime2

Nearest square below5,382,400

Nearest square above5,387,041

Powers & multiples

5,385,489 to the power 229,003,491,769,121

5,385,489 to the power 3156,197,985,884,191,685,169

5,385,489 to the power 4841,202,534,801,469,594,369,112,641

5,385,489 to the power 54,530,286,997,945,431,684,309,318,067,866,449

First ten multiples5,385,489, 10,770,978, 16,156,467, 21,541,956, 26,927,445, 32,312,934, 37,698,423, 43,083,912, 48,469,401, 53,854,890

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 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9No, remainder 6

Divisible by 10No, remainder 9

Divisible by 11No, remainder 10

Divisible by 12No, remainder 9

Divisible by 100No, remainder 89

Collatz (3n + 1) trajectory

Steps to reach 1157the total stopping time

Highest value reached16,156,4683× the starting value

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

First steps5,385,489 → 16,156,468 → 8,078,234 → 4,039,117 → 12,117,352 → 6,058,676 → 3,029,338 → 1,514,669 → 4,544,008 → 2,272,004 → …

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

As a percentage & fraction

As a percentage538,548,900%

5,385,489% as a decimal53,854.89

5,385,489% of 1005,385,489

5,385,489% of 1,00053,854,890

As a fraction of 1005,385,489/100

Read another way

As seconds62 days, 7 hours and 58 minutes

As bytes5.136 MiB

As a 24-bit colour#522D11

Keep nerding

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