Recognised as Number
1,058,477
- Positive
- Odd
- Composite
- 7 digits
1,058,477 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,058,477
Digit count7
Digit sum32
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation7 × 89 × 1,699
Distinct prime factors37, 89, 1,699
Number of divisors8
Sum of divisors σ(n)1,224,000
Aliquot sum165,523sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)896,544integers below n that share no factor with it
Carmichael function λ(n)74,712the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 896,544
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 89, 623, 1,699, 11,893, 151,211, 1,058,4778 in total
Arithmetic
Previous number1,058,476
Next number1,058,478
Double2,116,954
Half529,238.5
Square1,120,373,559,529
Cube1,185,889,644,169,577,333
Square root1,028.823114048≈irrational, shown to 9 decimal places
Cube root101.912426436≈
Negation-1,058,477
Reciprocal9.44753641 × 10^-7≈
Representations
Decimal1,058,477
Binary10000001001101010110121 bits
Octal4023255
Hexadecimal1026AD
Base 36MOQ5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, fifty-eight thousand, four hundred and seventy-seven
Ordinalone million, fifty-eight thousand, four hundred and seventy-seventh
Scientific notation1.058477 × 10^6
Engineering notation1.058477 × 10^6
In other bases
Ternary1222202221212base 3; the most digit-efficient integer base after e: 13 digits
Quinary232332402base 5; one hand: 9 digits
Septenary11665640base 7: 8 digits
Nonary1882855base 9; each digit is two ternary digits: 7 digits
Duodecimal430665base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6c63hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:54:1:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000T1000T0TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000111101111111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000010011010101101
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 ad
Gray code110000011010111111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000010011010101101
64-bit0000000000000000000000000000000000000000000100000010011010101101
One's complement11111111111011111101100101010010at 32 bits, every bit flipped
Bits reversed10110101011001000000100000000000at 32 bits
Rotated left by 100000000001000000100110101011010at 32 bits, wrapping
Shifted left by 11000000100110101011010= 2,116,954, no wrap
Shifted right by 110000001001101010110= 529,238, discarding the low bit
These bits as a double5.22957123 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,058,477 to the power 21,120,373,559,529
1,058,477 to the power 31,185,889,644,169,577,333
1,058,477 to the power 41,255,236,912,891,681,706,701,841
1,058,477 to the power 51,328,639,401,846,848,577,864,644,556,157
First ten multiples1,058,477, 2,116,954, 3,175,431, 4,233,908, 5,292,385, 6,350,862, 7,409,339, 8,467,816, 9,526,293, 10,584,770
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 77
Collatz (3n + 1) trajectory
Steps to reach 1196the total stopping time
Highest value reached3,175,4323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,058,477 → 3,175,432 → 1,587,716 → 793,858 → 396,929 → 1,190,788 → 595,394 → 297,697 → 893,092 → 446,546 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage105,847,700%
1,058,477% as a decimal10,584.77
1,058,477% of 1001,058,477
1,058,477% of 1,00010,584,770
As a fraction of 1001,058,477/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,058,477
Nerdulate something else
Nothing in mind? Surprise me · today’s page