Recognised as Number

1,024,893

Positive
Odd
Composite
7 digits

1,024,893 is an odd 7-digit integer and a composite number. It has 10 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,024,893

Digit count7

Digit sum27

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3^4 × 12,653

Distinct prime factors23, 12,653

Number of divisors10

Sum of divisors σ(n)1,531,134

Aliquot sum506,241sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)341,604the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 683,208

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 27, 81, 12,653, 37,959, 113,877, 341,631, 1,024,89310 in total

Arithmetic

Previous number1,024,892

Next number1,024,894

Double2,049,786

Half512,446.5

Square1,050,405,661,449

Cube1,076,553,409,579,449,957

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

Cube root100.822975205≈

Negation-1,024,893

Reciprocal9.75711611 × 10^-7≈

Representations

Decimal1,024,893

Binary1111101000110111110120 bits

Octal3721575

HexadecimalFA37D

Base 36LYT9

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

In wordsone million, twenty-four thousand, eight hundred and ninety-three

Ordinalone million, twenty-four thousand, eight hundred and ninety-third

Scientific notation1.024893 × 10^6

Engineering notation1.024893 × 10^6

In other bases

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

Quinary230244033base 5; one hand: 9 digits

Septenary11466012base 7: 8 digits

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

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

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

Sexagesimal4:44:41:33base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000011111010001101111101

Bit length20 bitsto write the magnitude

Set bits14the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 19worth 524,288

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes30f a3 7d

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

At each machine width

32-bit00000000000011111010001101111101

64-bit0000000000000000000000000000000000000000000011111010001101111101

One's complement11111111111100000101110010000010at 32 bits, every bit flipped

Bits reversed10111110110001011111000000000000at 32 bits

Rotated left by 100000000000111110100011011111010at 32 bits, wrapping

Shifted left by 1111110100011011111010= 2,049,786, no wrap

Shifted right by 11111101000110111110= 512,446, discarding the low bit

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

Nearest landmarks

Next prime1,024,901+8

Previous prime1,024,883−10

Distance to nearest prime8

Nearest square below1,024,144

Nearest square above1,026,169

Powers & multiples

1,024,893 to the power 21,050,405,661,449

1,024,893 to the power 31,076,553,409,579,449,957

1,024,893 to the power 41,103,352,053,604,111,204,779,601

1,024,893 to the power 51,130,817,796,274,478,345,000,179,607,693

First ten multiples1,024,893, 2,049,786, 3,074,679, 4,099,572, 5,124,465, 6,149,358, 7,174,251, 8,199,144, 9,224,037, 10,248,930

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 5

Divisible by 9Yes

Divisible by 10No, remainder 3

Divisible by 11No, remainder 1

Divisible by 12No, remainder 9

Divisible by 100No, remainder 93

Collatz (3n + 1) trajectory

Steps to reach 1183the total stopping time

Highest value reached3,891,4003× the starting value

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

First steps1,024,893 → 3,074,680 → 1,537,340 → 768,670 → 384,335 → 1,153,006 → 576,503 → 1,729,510 → 864,755 → 2,594,266 → …

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

As a percentage & fraction

As a percentage102,489,300%

1,024,893% as a decimal10,248.93

1,024,893% of 1001,024,893

1,024,893% of 1,00010,248,930

As a fraction of 1001,024,893/100

Read another way

As seconds11 days, 20 hours and 41 minutes

As bytes1,000.872 KiB

As a 24-bit colour#0FA37D

Keep nerding

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