Recognised as Number

1,052,690

Positive
Even
Composite
7 digits

1,052,690 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,052,690

Digit count7

Digit sum23

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 105,269

Distinct prime factors32, 5, 105,269

Number of divisors8

Sum of divisors σ(n)1,894,860

Aliquot sum842,170sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)105,268the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 421,072

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 105,269, 210,538, 526,345, 1,052,6908 in total

Arithmetic

Previous number1,052,689

Next number1,052,691

Double2,105,380

Half526,345

Square1,108,156,236,100

Cube1,166,544,988,180,109,000

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

Cube root101.726358687≈

Negation-1,052,690

Reciprocal9.49947278 × 10^-7≈

Representations

Decimal1,052,690

Binary10000000100000001001021 bits

Octal4010022

Hexadecimal101012

Base 36MK9E

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

In wordsone million, fifty-two thousand, six hundred and ninety

Ordinalone million, fifty-two thousand, six hundred and ninetieth

Scientific notation1.05269 × 10^6

Engineering notation1.05269 × 10^6

In other bases

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

Quinary232141230base 5; one hand: 9 digits

Septenary11643032base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100000001000000010010

Bit length21 bitsto write the magnitude

Set bits4the population count, or Hamming weight

Zero bits17within that length

Bit parityeven4 set bits, so even; not the same as the number itself being even

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes310 10 12

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

At each machine width

32-bit00000000000100000001000000010010

64-bit0000000000000000000000000000000000000000000100000001000000010010

One's complement11111111111011111110111111101101at 32 bits, every bit flipped

Bits reversed01001000000010000000100000000000at 32 bits

Rotated left by 100000000001000000010000000100100at 32 bits, wrapping

Shifted left by 11000000010000000100100= 2,105,380, no wrap

Shifted right by 110000000100000001001= 526,345, discarding the low bit

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

Nearest landmarks

Next prime1,052,693+3

Previous prime1,052,663−27

Distance to nearest prime3

Nearest square below1,052,676

Nearest square above1,054,729

Powers & multiples

1,052,690 to the power 21,108,156,236,100

1,052,690 to the power 31,166,544,988,180,109,000

1,052,690 to the power 41,228,010,243,607,318,943,210,000

1,052,690 to the power 51,292,714,103,342,988,578,327,734,900,000

First ten multiples1,052,690, 2,105,380, 3,158,070, 4,210,760, 5,263,450, 6,316,140, 7,368,830, 8,421,520, 9,474,210, 10,526,900

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6No, remainder 2

Divisible by 7No, remainder 2

Divisible by 8No, remainder 2

Divisible by 9No, remainder 5

Divisible by 10Yes

Divisible by 11No, remainder 1

Divisible by 12No, remainder 2

Divisible by 100No, remainder 90

Collatz (3n + 1) trajectory

Steps to reach 1196the total stopping time

Highest value reached2,664,6282× the starting value

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

First steps1,052,690 → 526,345 → 1,579,036 → 789,518 → 394,759 → 1,184,278 → 592,139 → 1,776,418 → 888,209 → 2,664,628 → …

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

As a percentage & fraction

As a percentage105,269,000%

1,052,690% as a decimal10,526.9

1,052,690% of 1001,052,690

1,052,690% of 1,00010,526,900

As a fraction of 1001,052,690/100

Read another way

As seconds12 days, 4 hours and 24 minutes

As bytes1.004 MiB

As a 24-bit colour#101012

Keep nerding

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