Recognised as Number

1,049,077

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,049,077

Digit count7

Digit sum28

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,049,077

Distinct prime factors11,049,077

Number of divisors2

Sum of divisors σ(n)1,049,078

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,049,076integers below n that share no factor with it

Carmichael function λ(n)1,049,076the 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,0772 in total

Arithmetic

Previous number1,049,076

Next number1,049,078

Double2,098,154

Half524,538.5

Square1,100,562,551,929

Cube1,154,574,860,290,019,533

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

Cube root101.609844924≈

Negation-1,049,077

Reciprocal9.53218877 × 10^-7≈

Representations

Decimal1,049,077

Binary10000000000011111010121 bits

Octal4000765

Hexadecimal1001F5

Base 36MHH1

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

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

Ordinalone million, forty-nine thousand and seventy-seventh

Scientific notation1.049077 × 10^6

Engineering notation1.049077 × 10^6

In other bases

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

Quinary232032302base 5; one hand: 9 digits

Septenary11626351base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100000000000111110101

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 f5

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

At each machine width

32-bit00000000000100000000000111110101

64-bit0000000000000000000000000000000000000000000100000000000111110101

One's complement11111111111011111111111000001010at 32 bits, every bit flipped

Bits reversed10101111100000000000100000000000at 32 bits

Rotated left by 100000000001000000000001111101010at 32 bits, wrapping

Shifted left by 11000000000001111101010= 2,098,154, no wrap

Shifted right by 110000000000011111010= 524,538, discarding the low bit

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

Nearest landmarks

Next prime1,049,089+12

Previous prime1,049,063−14

Distance to nearest prime0, it is prime

Nearest square below1,048,576

Nearest square above1,050,625

Powers & multiples

1,049,077 to the power 21,100,562,551,929

1,049,077 to the power 31,154,574,860,290,019,533

1,049,077 to the power 41,211,237,930,708,472,821,621,041

1,049,077 to the power 51,270,681,854,633,852,542,287,736,829,157

First ten multiples1,049,077, 2,098,154, 3,147,231, 4,196,308, 5,245,385, 6,294,462, 7,343,539, 8,392,616, 9,441,693, 10,490,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 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 7

Divisible by 11No, remainder 7

Divisible by 12No, remainder 1

Divisible by 100No, remainder 77

Collatz (3n + 1) trajectory

Steps to reach 1134the total stopping time

Highest value reached3,147,2323× the starting value

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

First steps1,049,077 → 3,147,232 → 1,573,616 → 786,808 → 393,404 → 196,702 → 98,351 → 295,054 → 147,527 → 442,582 → …

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

As a percentage & fraction

As a percentage104,907,700%

1,049,077% as a decimal10,490.77

1,049,077% of 1001,049,077

1,049,077% of 1,00010,490,770

As a fraction of 1001,049,077/100

Read another way

As seconds12 days, 3 hours and 24 minutes

As bytes1 MiB

As a 24-bit colour#1001F5

Keep nerding

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