Recognised as Number

1,049,075

Positive
Odd
Composite
7 digits

1,049,075 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,049,075

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 numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5^2 × 29 × 1,447

Distinct prime factors35, 29, 1,447

Number of divisors12

Sum of divisors σ(n)1,346,640

Aliquot sum297,565sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)101,220the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 809,760

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

SquarefreeNohas a repeated prime factor

All divisors1, 5, 25, 29, 145, 725, 1,447, 7,235, 36,175, 41,963, 209,815, 1,049,07512 in total

Arithmetic

Previous number1,049,074

Next number1,049,076

Double2,098,150

Half524,537.5

Square1,100,558,355,625

Cube1,154,568,256,927,296,875

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

Cube root101.609780353≈

Negation-1,049,075

Reciprocal9.53220694 × 10^-7≈

Representations

Decimal1,049,075

Binary10000000000011111001121 bits

Octal4000763

Hexadecimal1001F3

Base 36MHGZ

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

In wordsone million, forty-nine thousand and seventy-five

Ordinalone million, forty-nine thousand and seventy-fifth

Scientific notation1.049075 × 10^6

Engineering notation1.049075 × 10^6

In other bases

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

Quinary232032300base 5; one hand: 9 digits

Septenary11626346base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100000000000111110011

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 f3

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

At each machine width

32-bit00000000000100000000000111110011

64-bit0000000000000000000000000000000000000000000100000000000111110011

One's complement11111111111011111111111000001100at 32 bits, every bit flipped

Bits reversed11001111100000000000100000000000at 32 bits

Rotated left by 100000000001000000000001111100110at 32 bits, wrapping

Shifted left by 11000000000001111100110= 2,098,150, no wrap

Shifted right by 110000000000011111001= 524,537, discarding the low bit

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

Nearest landmarks

Next prime1,049,077+2

Previous prime1,049,063−12

Distance to nearest prime2

Nearest square below1,048,576

Nearest square above1,050,625

Powers & multiples

1,049,075 to the power 21,100,558,355,625

1,049,075 to the power 31,154,568,256,927,296,875

1,049,075 to the power 41,211,228,694,136,003,969,140,625

1,049,075 to the power 51,270,669,742,300,728,363,926,201,171,875

First ten multiples1,049,075, 2,098,150, 3,147,225, 4,196,300, 5,245,375, 6,294,450, 7,343,525, 8,392,600, 9,441,675, 10,490,750

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 5Yes

Divisible by 6No, remainder 5

Divisible by 7No, remainder 6

Divisible by 8No, remainder 3

Divisible by 9No, remainder 8

Divisible by 10No, remainder 5

Divisible by 11No, remainder 5

Divisible by 12No, remainder 11

Divisible by 100No, remainder 75

Collatz (3n + 1) trajectory

Steps to reach 1103the total stopping time

Highest value reached4,720,8404× the starting value

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

First steps1,049,075 → 3,147,226 → 1,573,613 → 4,720,840 → 2,360,420 → 1,180,210 → 590,105 → 1,770,316 → 885,158 → 442,579 → …

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

As a percentage & fraction

As a percentage104,907,500%

1,049,075% as a decimal10,490.75

1,049,075% of 1001,049,075

1,049,075% of 1,00010,490,750

As a fraction of 1001,049,075/100

Read another way

As seconds12 days, 3 hours and 24 minutes

As bytes1 MiB

As a 24-bit colour#1001F3

Keep nerding

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