Recognised as Number
1,063,147
- Positive
- Odd
- Composite
- 7 digits
1,063,147 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,063,147
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 factorisation83 × 12,809
Distinct prime factors283, 12,809
Number of divisors4
Sum of divisors σ(n)1,076,040
Aliquot sum12,893sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,050,256integers below n that share no factor with it
Carmichael function λ(n)525,128the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,050,256
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 83, 12,809, 1,063,1474 in total
Arithmetic
Previous number1,063,146
Next number1,063,148
Double2,126,294
Half531,573.5
Square1,130,281,543,609
Cube1,201,655,432,243,277,523
Square root1,031.09019974≈irrational, shown to 9 decimal places
Cube root102.062085744≈
Negation-1,063,147
Reciprocal9.40603698 × 10^-7≈
Representations
Decimal1,063,147
Binary10000001110001110101121 bits
Octal4034353
Hexadecimal1038EB
Base 36MSBV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, sixty-three thousand, one hundred and forty-seven
Ordinalone million, sixty-three thousand, one hundred and forty-seventh
Scientific notation1.063147 × 10^6
Engineering notation1.063147 × 10^6
In other bases
Ternary2000000100211base 3; the most digit-efficient integer base after e: 13 digits
Quinary233010042base 5; one hand: 9 digits
Septenary12015361base 7: 8 digits
Nonary2000324base 9; each digit is two ternary digits: 7 digits
Duodecimal4332b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6chh7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:55:19:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000000101T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000100100100111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000011100011101011
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 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 38 eb
Gray code110000010010010011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000011100011101011
64-bit0000000000000000000000000000000000000000000100000011100011101011
One's complement11111111111011111100011100010100at 32 bits, every bit flipped
Bits reversed11010111000111000000100000000000at 32 bits
Rotated left by 100000000001000000111000111010110at 32 bits, wrapping
Shifted left by 11000000111000111010110= 2,126,294, no wrap
Shifted right by 110000001110001110101= 531,573, discarding the low bit
These bits as a double5.25264409 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,063,147 to the power 21,130,281,543,609
1,063,147 to the power 31,201,655,432,243,277,523
1,063,147 to the power 41,277,536,367,823,143,768,744,881
1,063,147 to the power 51,358,208,956,842,071,828,309,814,000,507
First ten multiples1,063,147, 2,126,294, 3,189,441, 4,252,588, 5,315,735, 6,378,882, 7,442,029, 8,505,176, 9,568,323, 10,631,470
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1271the total stopping time
Highest value reached14,747,48813× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,063,147 → 3,189,442 → 1,594,721 → 4,784,164 → 2,392,082 → 1,196,041 → 3,588,124 → 1,794,062 → 897,031 → 2,691,094 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage106,314,700%
1,063,147% as a decimal10,631.47
1,063,147% of 1001,063,147
1,063,147% of 1,00010,631,470
As a fraction of 1001,063,147/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,063,147
Nerdulate something else
Nothing in mind? Surprise me · today’s page