Recognised as Number

1,058,391

Positive
Odd
Composite
7 digits

1,058,391 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 value1,058,391

Digit count7

Digit sum27

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 × 23 × 5,113

Distinct prime factors33, 23, 5,113

Number of divisors12

Sum of divisors σ(n)1,595,568

Aliquot sum537,177sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)674,784integers below n that share no factor with it

Carmichael function λ(n)56,232the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 674,784

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 23, 69, 207, 5,113, 15,339, 46,017, 117,599, 352,797, 1,058,39112 in total

Arithmetic

Previous number1,058,390

Next number1,058,392

Double2,116,782

Half529,195.5

Square1,120,191,508,881

Cube1,185,600,611,276,070,471

Square root1,028.781317871≈irrational, shown to 9 decimal places

Cube root101.909666273≈

Negation-1,058,391

Reciprocal9.44830408 × 10^-7≈

Representations

Decimal1,058,391

Binary10000001001100101011121 bits

Octal4023127

Hexadecimal102657

Base 36MONR

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

In wordsone million, fifty-eight thousand, three hundred and ninety-one

Ordinalone million, fifty-eight thousand, three hundred and ninety-first

Scientific notation1.058391 × 10^6

Engineering notation1.058391 × 10^6

In other bases

Ternary1222202211200base 3; the most digit-efficient integer base after e: 13 digits

Quinary232332031base 5; one hand: 9 digits

Septenary11665455base 7: 8 digits

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

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

Vigesimal6c5jbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal4:53:59:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100000010011001010111

Bit length21 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits12within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes310 26 57

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

At each machine width

32-bit00000000000100000010011001010111

64-bit0000000000000000000000000000000000000000000100000010011001010111

One's complement11111111111011111101100110101000at 32 bits, every bit flipped

Bits reversed11101010011001000000100000000000at 32 bits

Rotated left by 100000000001000000100110010101110at 32 bits, wrapping

Shifted left by 11000000100110010101110= 2,116,782, no wrap

Shifted right by 110000001001100101011= 529,195, discarding the low bit

These bits as a double5.22914633 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,058,419+28

Previous prime1,058,389−2

Distance to nearest prime2

Nearest square below1,056,784

Nearest square above1,058,841

Powers & multiples

1,058,391 to the power 21,120,191,508,881

1,058,391 to the power 31,185,600,611,276,070,471

1,058,391 to the power 41,254,829,016,569,091,501,872,161

1,058,391 to the power 51,328,099,737,675,577,323,757,978,352,951

First ten multiples1,058,391, 2,116,782, 3,175,173, 4,233,564, 5,291,955, 6,350,346, 7,408,737, 8,467,128, 9,525,519, 10,583,910

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 7

Divisible by 9Yes

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 3

Divisible by 100No, remainder 91

Collatz (3n + 1) trajectory

Steps to reach 1196the total stopping time

Highest value reached7,144,1446× the starting value

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

First steps1,058,391 → 3,175,174 → 1,587,587 → 4,762,762 → 2,381,381 → 7,144,144 → 3,572,072 → 1,786,036 → 893,018 → 446,509 → …

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

As a percentage & fraction

As a percentage105,839,100%

1,058,391% as a decimal10,583.91

1,058,391% of 1001,058,391

1,058,391% of 1,00010,583,910

As a fraction of 1001,058,391/100

Read another way

As seconds12 days, 5 hours and 59 minutes

As bytes1.009 MiB

As a 24-bit colour#102657

Keep nerding

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