Recognised as Number
1,316,625
- Positive
- Odd
- Composite
- 7 digits
1,316,625 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,316,625
Digit count7
Digit sum24
Digit product1,080
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 5^3 × 3,511
Distinct prime factors33, 5, 3,511
Number of divisors16
Sum of divisors σ(n)2,191,488
Aliquot sum874,863sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)702,000integers below n that share no factor with it
Carmichael function λ(n)35,100the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 702,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 15, 25, 75, 125, 375, 3,511, 10,533, 17,555, 52,665, 87,775, 263,325, 438,875, 1,316,62516 in total
Arithmetic
Previous number1,316,624
Next number1,316,626
Double2,633,250
Half658,312.5
Square1,733,501,390,625
Cube2,282,371,268,431,640,625
Square root1,147.442809032≈irrational, shown to 9 decimal places
Cube root109.602560235≈
Negation-1,316,625
Reciprocal7.59517706 × 10^-7≈
Representations
Decimal1,316,625
Binary10100000101110001000121 bits
Octal5013421
Hexadecimal141711
Base 36S7WX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and sixteen thousand, six hundred and twenty-five
Ordinalone million, three hundred and sixteen thousand, six hundred and twenty-fifth
Scientific notation1.316625 × 10^6
Engineering notation1.316625 × 10^6
In other bases
Ternary2110220001220base 3; the most digit-efficient integer base after e: 13 digits
Quinary314113000base 5; one hand: 9 digits
Septenary14122362base 7: 8 digits
Nonary2426056base 9; each digit is two ternary digits: 7 digits
Duodecimal535b29base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal84bb5base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:5:43:45base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1110T001T0T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000110101100010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000001011100010001
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
Bytes314 17 11
Gray code111100001110010011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000001011100010001
64-bit0000000000000000000000000000000000000000000101000001011100010001
One's complement11111111111010111110100011101110at 32 bits, every bit flipped
Bits reversed10001000111010000010100000000000at 32 bits
Rotated left by 100000000001010000010111000100010at 32 bits, wrapping
Shifted left by 11010000010111000100010= 2,633,250, no wrap
Shifted right by 110100000101110001000= 658,312, discarding the low bit
These bits as a double6.50499181 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,316,625 to the power 21,733,501,390,625
1,316,625 to the power 32,282,371,268,431,640,625
1,316,625 to the power 43,005,027,071,298,808,837,890,625
1,316,625 to the power 53,956,493,767,748,794,186,187,744,140,625
First ten multiples1,316,625, 2,633,250, 3,949,875, 5,266,500, 6,583,125, 7,899,750, 9,216,375, 10,533,000, 11,849,625, 13,166,250
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
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 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 5
Divisible by 11No, remainder 2
Divisible by 12No, remainder 9
Divisible by 100No, remainder 25
Collatz (3n + 1) trajectory
Steps to reach 1142the total stopping time
Highest value reached3,949,8763× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,316,625 → 3,949,876 → 1,974,938 → 987,469 → 2,962,408 → 1,481,204 → 740,602 → 370,301 → 1,110,904 → 555,452 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage131,662,500%
1,316,625% as a decimal13,166.25
1,316,625% of 1001,316,625
1,316,625% of 1,00013,166,250
As a fraction of 1001,316,625/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,316,625
Nerdulate something else
Nothing in mind? Surprise me · today’s page