Recognised as Number
1,006,365
- Positive
- Odd
- Composite
- 7 digits
1,006,365 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,006,365
Digit count7
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 5 × 23 × 2,917
Distinct prime factors43, 5, 23, 2,917
Number of divisors16
Sum of divisors σ(n)1,680,768
Aliquot sum674,403sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)513,216integers below n that share no factor with it
Carmichael function λ(n)32,076the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 513,216
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 15, 23, 69, 115, 345, 2,917, 8,751, 14,585, 43,755, 67,091, 201,273, 335,455, 1,006,36516 in total
Arithmetic
Previous number1,006,364
Next number1,006,366
Double2,012,730
Half503,182.5
Square1,012,770,513,225
Cube1,019,216,797,541,677,125
Square root1,003.1774519≈irrational, shown to 9 decimal places
Cube root100.211718105≈
Negation-1,006,365
Reciprocal9.93675257 × 10^-7≈
Representations
Decimal1,006,365
Binary1111010110110001110120 bits
Octal3655435
HexadecimalF5B1D
Base 36LKIL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six thousand, three hundred and sixty-five
Ordinalone million, six thousand, three hundred and sixty-fifth
Scientific notation1.006365 × 10^6
Engineering notation1.006365 × 10^6
In other bases
Ternary1220010110210base 3; the most digit-efficient integer base after e: 13 digits
Quinary224200430base 5; one hand: 9 digits
Septenary11361003base 7: 8 digits
Nonary1803423base 9; each digit is two ternary digits: 7 digits
Duodecimal406479base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal65fi5base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:39:32:45base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T0010111T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001010111101101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011110101101100011101
Bit length20 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits7within that length
Bit parityodd13 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 1d
Gray code10001111011010010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011110101101100011101
64-bit0000000000000000000000000000000000000000000011110101101100011101
One's complement11111111111100001010010011100010at 32 bits, every bit flipped
Bits reversed10111000110110101111000000000000at 32 bits
Rotated left by 100000000000111101011011000111010at 32 bits, wrapping
Shifted left by 1111101011011000111010= 2,012,730, no wrap
Shifted right by 11111010110110001110= 503,182, discarding the low bit
These bits as a double4.97210374 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,006,365 to the power 21,012,770,513,225
1,006,365 to the power 31,019,216,797,541,677,125
1,006,365 to the power 41,025,704,112,458,029,899,900,625
1,006,365 to the power 51,032,232,719,133,825,260,213,492,478,125
First ten multiples1,006,365, 2,012,730, 3,019,095, 4,025,460, 5,031,825, 6,038,190, 7,044,555, 8,050,920, 9,057,285, 10,063,650
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 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 5
Divisible by 11No, remainder 8
Divisible by 12No, remainder 9
Divisible by 100No, remainder 65
Collatz (3n + 1) trajectory
Steps to reach 190the total stopping time
Highest value reached3,019,0963× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,006,365 → 3,019,096 → 1,509,548 → 754,774 → 377,387 → 1,132,162 → 566,081 → 1,698,244 → 849,122 → 424,561 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage100,636,500%
1,006,365% as a decimal10,063.65
1,006,365% of 1001,006,365
1,006,365% of 1,00010,063,650
As a fraction of 1001,006,365/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,006,365
Nerdulate something else
Nothing in mind? Surprise me · today’s page