Recognised as Number
1,058,249
- Positive
- Odd
- Prime
- 7 digits
1,058,249 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,058,249
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,058,249
Distinct prime factors11,058,249
Number of divisors2
Sum of divisors σ(n)1,058,250
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,058,248integers below n that share no factor with it
Carmichael function λ(n)1,058,248the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,058,2492 in total
Arithmetic
Previous number1,058,248
Next number1,058,250
Double2,116,498
Half529,124.5
Square1,119,890,946,001
Cube1,185,123,473,714,612,249
Square root1,028.712301861≈irrational, shown to 9 decimal places
Cube root101.905108468≈
Negation-1,058,249
Reciprocal9.44957189 × 10^-7≈
Representations
Decimal1,058,249
Binary10000001001011100100121 bits
Octal4022711
Hexadecimal1025C9
Base 36MOJT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, fifty-eight thousand, two hundred and forty-nine
Ordinalone million, fifty-eight thousand, two hundred and forty-ninth
Scientific notation1.058249 × 10^6
Engineering notation1.058249 × 10^6
In other bases
Ternary1222202122102base 3; the most digit-efficient integer base after e: 13 digits
Quinary232330444base 5; one hand: 9 digits
Septenary11665163base 7: 8 digits
Nonary1882572base 9; each digit is two ternary digits: 7 digits
Duodecimal4304b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6c5c9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:53:57:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000T10T0T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000111101011011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000010010111001001
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes310 25 c9
Gray code110000011011100101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000010010111001001
64-bit0000000000000000000000000000000000000000000100000010010111001001
One's complement11111111111011111101101000110110at 32 bits, every bit flipped
Bits reversed10010011101001000000100000000000at 32 bits
Rotated left by 100000000001000000100101110010010at 32 bits, wrapping
Shifted left by 11000000100101110010010= 2,116,498, no wrap
Shifted right by 110000001001011100100= 529,124, discarding the low bit
These bits as a double5.22844476 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,058,249 to the power 21,119,890,946,001
1,058,249 to the power 31,185,123,473,714,612,249
1,058,249 to the power 41,254,155,730,935,014,697,892,001
1,058,249 to the power 51,327,209,048,106,248,369,029,512,166,249
First ten multiples1,058,249, 2,116,498, 3,174,747, 4,232,996, 5,291,245, 6,349,494, 7,407,743, 8,465,992, 9,524,241, 10,582,490
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 1103the total stopping time
Highest value reached5,357,3925× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,058,249 → 3,174,748 → 1,587,374 → 793,687 → 2,381,062 → 1,190,531 → 3,571,594 → 1,785,797 → 5,357,392 → 2,678,696 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage105,824,900%
1,058,249% as a decimal10,582.49
1,058,249% of 1001,058,249
1,058,249% of 1,00010,582,490
As a fraction of 1001,058,249/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,249
Nerdulate something else
Nothing in mind? Surprise me · today’s page