Nerdulator> put something in

Recognised as Number

1,049,039

  • Positive
  • Odd
  • Prime
  • 7 digits

1,049,039 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,049,039
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,049,039
Distinct prime factors11,049,039
Number of divisors2
Sum of divisors σ(n)1,049,040
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,049,038integers below n that share no factor with it
Carmichael function λ(n)1,049,038the 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,049,0392 in total

Arithmetic

Previous number1,049,038
Next number1,049,040
Double2,098,078
Cube1,154,449,400,703,646,319
Square root1,024.226049268≈irrational, shown to 9 decimal places
Cube root101.608618061≈
Negation-1,049,039
Reciprocal9.53253406 × 10^-7≈

Representations

Decimal1,049,039
Binary10000000000011100111121 bits
Octal4000717
Hexadecimal1001CF
Base 36MHFZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, forty-nine thousand and thirty-nine
Ordinalone million, forty-nine thousand and thirty-ninth
Scientific notation1.049039 × 10^6
Engineering notation1.049039 × 10^6

In other bases

Ternary1222022000022base 3; the most digit-efficient integer base after e: 13 digits
Quinary232032124base 5; one hand: 9 digits
Septenary11626265base 7: 8 digits
Nonary1868008base 9; each digit is two ternary digits: 7 digits
Duodecimal4270bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6b2bjbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:51:23:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T10T00010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000000011011010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000100000000000111001111
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 01 cf
Gray code110000000000100101000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000100000000000111001111
64-bit0000000000000000000000000000000000000000000100000000000111001111
One's complement11111111111011111111111000110000at 32 bits, every bit flipped
Bits reversed11110011100000000000100000000000at 32 bits
Rotated left by 100000000001000000000001110011110at 32 bits, wrapping
Shifted left by 11000000000001110011110= 2,098,078, no wrap
Shifted right by 110000000000011100111= 524,519, discarding the low bit
These bits as a double5.18294131 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,049,051+12
Previous prime1,049,023−16
Distance to nearest prime0, it is prime
Nearest square below1,048,576
Nearest square above1,050,625

Powers & multiples

1,049,039 to the power 21,100,482,823,521
1,049,039 to the power 31,154,449,400,703,646,319
1,049,039 to the power 41,211,062,444,864,752,430,837,441
1,049,039 to the power 51,270,451,736,098,475,025,293,278,269,199
First ten multiples1,049,039, 2,098,078, 3,147,117, 4,196,156, 5,245,195, 6,294,234, 7,343,273, 8,392,312, 9,441,351, 10,490,390
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 39

Collatz (3n + 1) trajectory

Steps to reach 1103the total stopping time
Highest value reached10,621,52810× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,049,039 → 3,147,118 → 1,573,559 → 4,720,678 → 2,360,339 → 7,081,018 → 3,540,509 → 10,621,528 → 5,310,764 → 2,655,382 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage104,903,900%
1,049,039% as a decimal10,490.39
1,049,039% of 1001,049,039
1,049,039% of 1,00010,490,390
As a fraction of 1001,049,039/100

Read another way

As bytes1 MiB
As a 24-bit colour#1001CF

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “1049039” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.