Recognised as Number

1,066,325

Positive
Odd
Composite
7 digits

1,066,325 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,066,325

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 factorisation5^2 × 13 × 17 × 193

Distinct prime factors45, 13, 17, 193

Number of divisors24

Sum of divisors σ(n)1,515,528

Aliquot sum449,203sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)960the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 737,280

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

SquarefreeNohas a repeated prime factor

All divisors1, 5, 13, 17, 25, 65, 85, 193, 221, 325, 425, 965, 1,105, 2,509, 3,281, 4,825, 5,525, 12,545, 16,405, 42,653, 62,725, 82,025, 213,265, 1,066,32524 in total

Arithmetic

Previous number1,066,324

Next number1,066,326

Double2,132,650

Half533,162.5

Square1,137,049,005,625

Cube1,212,463,780,923,078,125

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

Cube root102.163680555≈

Negation-1,066,325

Reciprocal9.37800389 × 10^-7≈

Representations

Decimal1,066,325

Binary10000010001010101010121 bits

Octal4042525

Hexadecimal104555

Base 36MUS5

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

In wordsone million, sixty-six thousand, three hundred and twenty-five

Ordinalone million, sixty-six thousand, three hundred and twenty-fifth

Scientific notation1.066325 × 10^6

Engineering notation1.066325 × 10^6

In other bases

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

Quinary233110300base 5; one hand: 9 digits

Septenary12030551base 7: 8 digits

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

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

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

Sexagesimal4:56:12:5base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100000100010101010101

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 45 55

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

At each machine width

32-bit00000000000100000100010101010101

64-bit0000000000000000000000000000000000000000000100000100010101010101

One's complement11111111111011111011101010101010at 32 bits, every bit flipped

Bits reversed10101010101000100000100000000000at 32 bits

Rotated left by 100000000001000001000101010101010at 32 bits, wrapping

Shifted left by 11000001000101010101010= 2,132,650, no wrap

Shifted right by 110000010001010101010= 533,162, discarding the low bit

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

Nearest landmarks

Next prime1,066,327+2

Previous prime1,066,319−6

Distance to nearest prime2

Nearest square below1,065,024

Nearest square above1,067,089

Powers & multiples

1,066,325 to the power 21,137,049,005,625

1,066,325 to the power 31,212,463,780,923,078,125

1,066,325 to the power 41,292,880,441,192,801,281,640,625

1,066,325 to the power 51,378,630,736,454,913,826,645,439,453,125

First ten multiples1,066,325, 2,132,650, 3,198,975, 4,265,300, 5,331,625, 6,397,950, 7,464,275, 8,530,600, 9,596,925, 10,663,250

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 1

Divisible by 5Yes

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 5

Divisible by 10No, remainder 5

Divisible by 11No, remainder 7

Divisible by 12No, remainder 5

Divisible by 100No, remainder 25

Collatz (3n + 1) trajectory

Steps to reach 1134the total stopping time

Highest value reached3,198,9763× the starting value

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

First steps1,066,325 → 3,198,976 → 1,599,488 → 799,744 → 399,872 → 199,936 → 99,968 → 49,984 → 24,992 → 12,496 → …

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

As a percentage & fraction

As a percentage106,632,500%

1,066,325% as a decimal10,663.25

1,066,325% of 1001,066,325

1,066,325% of 1,00010,663,250

As a fraction of 1001,066,325/100

Read another way

As seconds12 days, 8 hours and 12 minutes

As bytes1.017 MiB

As a 24-bit colour#104555

Keep nerding

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