Recognised as Number

1,021,952

Positive
Even
Composite
7 digits

1,021,952 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,021,952

Digit count7

Digit sum20

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 factorisation2^11 × 499

Distinct prime factors22, 499

Number of divisors24

Sum of divisors σ(n)2,047,500

Aliquot sum1,025,548sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)127,488the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 509,952

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 32, 64, 128, 256, 499, 512, 998, 1,024, 1,996, 2,048, 3,992, 7,984, 15,968, 31,936, 63,872, 127,744, 255,488, 510,976, 1,021,95224 in total

Arithmetic

Previous number1,021,951

Next number1,021,953

Double2,043,904

Half510,976

Square1,044,385,890,304

Cube1,067,312,249,367,953,408

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

Cube root100.726443355≈

Negation-1,021,952

Reciprocal9.78519539 × 10^-7≈

Representations

Decimal1,021,952

Binary1111100110000000000020 bits

Octal3714000

HexadecimalF9800

Base 36LWJK

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

In wordsone million, twenty-one thousand, nine hundred and fifty-two

Ordinalone million, twenty-one thousand, nine hundred and fifty-second

Scientific notation1.021952 × 10^6

Engineering notation1.021952 × 10^6

In other bases

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

Quinary230200302base 5; one hand: 9 digits

Septenary11454311base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000011111001100000000000

Bit length20 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits13within that length

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

Highest set bitbit 19worth 524,288

Lowest set bitbit 1111 trailing zeros

Power of twoNo

Bytes30f 98 00

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

At each machine width

32-bit00000000000011111001100000000000

64-bit0000000000000000000000000000000000000000000011111001100000000000

One's complement11111111111100000110011111111111at 32 bits, every bit flipped

Bits reversed00000000000110011111000000000000at 32 bits

Rotated left by 100000000000111110011000000000000at 32 bits, wrapping

Shifted left by 1111110011000000000000= 2,043,904, no wrap

Shifted right by 11111100110000000000= 510,976, discarding the low bit

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

Nearest landmarks

Next prime1,021,961+9

Previous prime1,021,919−33

Distance to nearest prime9

Nearest square below1,020,100

Nearest square above1,022,121

Powers & multiples

1,021,952 to the power 21,044,385,890,304

1,021,952 to the power 31,067,312,249,367,953,408

1,021,952 to the power 41,090,741,887,866,078,721,212,416

1,021,952 to the power 51,114,685,853,788,514,881,300,470,956,032

First ten multiples1,021,952, 2,043,904, 3,065,856, 4,087,808, 5,109,760, 6,131,712, 7,153,664, 8,175,616, 9,197,568, 10,219,520

Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7No, remainder 1

Divisible by 8Yes

Divisible by 9No, remainder 2

Divisible by 10No, remainder 2

Divisible by 11No, remainder 8

Divisible by 12No, remainder 8

Divisible by 100No, remainder 52

Collatz (3n + 1) trajectory

Steps to reach 159the total stopping time

Highest value reached1,021,952

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

First steps1,021,952 → 510,976 → 255,488 → 127,744 → 63,872 → 31,936 → 15,968 → 7,984 → 3,992 → 1,996 → …

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

As a percentage & fraction

As a percentage102,195,200%

1,021,952% as a decimal10,219.52

1,021,952% of 1001,021,952

1,021,952% of 1,00010,219,520

As a fraction of 1001,021,952/100

Read another way

As seconds11 days, 19 hours and 52 minutes

As bytes998 KiB

As a 24-bit colour#0F9800

Keep nerding

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