Recognised as Number

1,006,465

Positive
Odd
Composite
7 digits

1,006,465 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,006,465

Digit count7

Digit sum22

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 101 × 1,993

Distinct prime factors35, 101, 1,993

Number of divisors8

Sum of divisors σ(n)1,220,328

Aliquot sum213,863sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)49,800the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 796,800

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 101, 505, 1,993, 9,965, 201,293, 1,006,4658 in total

Arithmetic

Previous number1,006,464

Next number1,006,466

Double2,012,930

Half503,232.5

Square1,012,971,796,225

Cube1,019,520,658,887,594,625

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

Cube root100.215037258≈

Negation-1,006,465

Reciprocal9.93576528 × 10^-7≈

Representations

Decimal1,006,465

Binary1111010110111000000120 bits

Octal3655601

HexadecimalF5B81

Base 36LKLD

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

In wordsone million, six thousand, four hundred and sixty-five

Ordinalone million, six thousand, four hundred and sixty-fifth

Scientific notation1.006465 × 10^6

Engineering notation1.006465 × 10^6

In other bases

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

Quinary224201330base 5; one hand: 9 digits

Septenary11361205base 7: 8 digits

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

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

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

Sexagesimal4:39:34:25base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000011110101101110000001

Bit length20 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits9within that length

Bit parityodd11 set bits, so odd; 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 5b 81

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

At each machine width

32-bit00000000000011110101101110000001

64-bit0000000000000000000000000000000000000000000011110101101110000001

One's complement11111111111100001010010001111110at 32 bits, every bit flipped

Bits reversed10000001110110101111000000000000at 32 bits

Rotated left by 100000000000111101011011100000010at 32 bits, wrapping

Shifted left by 1111101011011100000010= 2,012,930, no wrap

Shifted right by 11111010110111000000= 503,232, discarding the low bit

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

Nearest landmarks

Next prime1,006,469+4

Previous prime1,006,463−2

Distance to nearest prime2

Nearest square below1,006,009

Nearest square above1,008,016

Powers & multiples

1,006,465 to the power 21,012,971,796,225

1,006,465 to the power 31,019,520,658,887,594,625

1,006,465 to the power 41,026,111,859,947,302,924,250,625

1,006,465 to the power 51,032,745,673,121,862,237,655,905,290,625

First ten multiples1,006,465, 2,012,930, 3,019,395, 4,025,860, 5,032,325, 6,038,790, 7,045,255, 8,051,720, 9,058,185, 10,064,650

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 5

Divisible by 11No, remainder 9

Divisible by 12No, remainder 1

Divisible by 100No, remainder 65

Collatz (3n + 1) trajectory

Steps to reach 1170the total stopping time

Highest value reached11,620,74411× the starting value

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

First steps1,006,465 → 3,019,396 → 1,509,698 → 754,849 → 2,264,548 → 1,132,274 → 566,137 → 1,698,412 → 849,206 → 424,603 → …

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

As a percentage & fraction

As a percentage100,646,500%

1,006,465% as a decimal10,064.65

1,006,465% of 1001,006,465

1,006,465% of 1,00010,064,650

As a fraction of 1001,006,465/100

Read another way

As seconds11 days, 15 hours and 34 minutes

As bytes982.876 KiB

As a 24-bit colour#0F5B81

Keep nerding

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