Recognised as Number
1,058,476
- Positive
- Even
- Composite
- 7 digits
1,058,476 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,058,476
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 factorisation2^2 × 264,619
Distinct prime factors22, 264,619
Number of divisors6
Sum of divisors σ(n)1,852,340
Aliquot sum793,864sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)529,236integers below n that share no factor with it
Carmichael function λ(n)264,618the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 529,236
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 264,619, 529,238, 1,058,4766 in total
Arithmetic
Previous number1,058,475
Next number1,058,477
Double2,116,952
Half529,238
Square1,120,371,442,576
Cube1,185,886,283,052,074,176
Square root1,028.822628056≈irrational, shown to 9 decimal places
Cube root101.912394342≈
Negation-1,058,476
Reciprocal9.44754534 × 10^-7≈
Representations
Decimal1,058,476
Binary10000001001101010110021 bits
Octal4023254
Hexadecimal1026AC
Base 36MOQ4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, fifty-eight thousand, four hundred and seventy-six
Ordinalone million, fifty-eight thousand, four hundred and seventy-sixth
Scientific notation1.058476 × 10^6
Engineering notation1.058476 × 10^6
In other bases
Ternary1222202221211base 3; the most digit-efficient integer base after e: 13 digits
Quinary232332401base 5; one hand: 9 digits
Septenary11665636base 7: 8 digits
Nonary1882854base 9; each digit is two ternary digits: 7 digits
Duodecimal430664base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6c63gbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:54:1:16base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000T1000TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000111101111111100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000010011010101100
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes310 26 ac
Gray code110000011010111111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000010011010101100
64-bit0000000000000000000000000000000000000000000100000010011010101100
One's complement11111111111011111101100101010011at 32 bits, every bit flipped
Bits reversed00110101011001000000100000000000at 32 bits
Rotated left by 100000000001000000100110101011000at 32 bits, wrapping
Shifted left by 11000000100110101011000= 2,116,952, no wrap
Shifted right by 110000001001101010110= 529,238, discarding the low bit
These bits as a double5.22956629 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,058,476 to the power 21,120,371,442,576
1,058,476 to the power 31,185,886,283,052,074,176
1,058,476 to the power 41,255,232,169,339,827,265,515,776
1,058,476 to the power 51,328,633,125,674,143,004,694,076,517,376
First ten multiples1,058,476, 2,116,952, 3,175,428, 4,233,904, 5,292,380, 6,350,856, 7,409,332, 8,467,808, 9,526,284, 10,584,760
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10No, remainder 6
Divisible by 11No, remainder 1
Divisible by 12No, remainder 4
Divisible by 100No, remainder 76
Collatz (3n + 1) trajectory
Steps to reach 1196the total stopping time
Highest value reached2,543,2362× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,058,476 → 529,238 → 264,619 → 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,600%
1,058,476% as a decimal10,584.76
1,058,476% of 1001,058,476
1,058,476% of 1,00010,584,760
As a fraction of 1001,058,476/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,476
Nerdulate something else
Nothing in mind? Surprise me · today’s page