Recognised as Number

5,801,539

Positive
Odd
Composite
7 digits

5,801,539 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value5,801,539

Digit count7

Digit sum31

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation17 × 47 × 53 × 137

Distinct prime factors417, 47, 53, 137

Number of divisors16

Sum of divisors σ(n)6,438,528

Aliquot sum636,989sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)5,204,992integers below n that share no factor with it

Carmichael function λ(n)81,328the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,204,992

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 17, 47, 53, 137, 799, 901, 2,329, 2,491, 6,439, 7,261, 42,347, 109,463, 123,437, 341,267, 5,801,53916 in total

Arithmetic

Previous number5,801,538

Next number5,801,540

Double11,603,078

Half2,900,769.5

Square33,657,854,768,521

Cube195,267,357,095,910,553,819

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

Cube root179.686068026≈

Negation-5,801,539

Reciprocal1.72368056 × 10^-7≈

Representations

Decimal5,801,539

Binary1011000100001100100001123 bits

Octal26103103

Hexadecimal588643

Base 363GCHV

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

In wordsfive million, eight hundred and one thousand, five hundred and thirty-nine

Ordinalfive million, eight hundred and one thousand, five hundred and thirty-ninth

Scientific notation5.801539 × 10^6

Engineering notation5.801539 × 10^6

In other bases

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

Quinary2441122124base 5; one hand: 10 digits

Septenary100212052base 7: 9 digits

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

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

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

Sexagesimal26:51:32:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000010110001000011001000011

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

Bytes358 86 43

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

At each machine width

32-bit00000000010110001000011001000011

64-bit0000000000000000000000000000000000000000010110001000011001000011

One's complement11111111101001110111100110111100at 32 bits, every bit flipped

Bits reversed11000010011000010001101000000000at 32 bits

Rotated left by 100000000101100010000110010000110at 32 bits, wrapping

Shifted left by 1101100010000110010000110= 11,603,078, no wrap

Shifted right by 11011000100001100100001= 2,900,769, discarding the low bit

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

Nearest landmarks

Next prime5,801,561+22

Previous prime5,801,531−8

Distance to nearest prime8

Nearest square below5,798,464

Nearest square above5,803,281

Powers & multiples

5,801,539 to the power 233,657,854,768,521

5,801,539 to the power 3195,267,357,095,910,553,819

5,801,539 to the power 41,132,851,187,618,851,818,492,527,441

5,801,539 to the power 56,572,280,346,167,085,960,205,319,157,531,699

First ten multiples5,801,539, 11,603,078, 17,404,617, 23,206,156, 29,007,695, 34,809,234, 40,610,773, 46,412,312, 52,213,851, 58,015,390

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 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 3

Divisible by 9No, remainder 4

Divisible by 10No, remainder 9

Divisible by 11No, remainder 7

Divisible by 12No, remainder 7

Divisible by 100No, remainder 39

Collatz (3n + 1) trajectory

Steps to reach 1126the total stopping time

Highest value reached26,463,1844× the starting value

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

First steps5,801,539 → 17,404,618 → 8,702,309 → 26,106,928 → 13,053,464 → 6,526,732 → 3,263,366 → 1,631,683 → 4,895,050 → 2,447,525 → …

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

As a percentage & fraction

As a percentage580,153,900%

5,801,539% as a decimal58,015.39

5,801,539% of 1005,801,539

5,801,539% of 1,00058,015,390

As a fraction of 1005,801,539/100

Read another way

As seconds67 days, 3 hours and 32 minutes

As bytes5.533 MiB

As a 24-bit colour#588643

Keep nerding

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