Recognised as Number
7,125,617
- Positive
- Odd
- Prime
- 7 digits
7,125,617 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,125,617
Digit count7
Digit sum29
Digit product2,940
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,125,617
Distinct prime factors17,125,617
Number of divisors2
Sum of divisors σ(n)7,125,618
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,125,616integers below n that share no factor with it
Carmichael function λ(n)7,125,616the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7,125,6172 in total
Arithmetic
Previous number7,125,616
Next number7,125,618
Double14,251,234
Half3,562,808.5
Square50,774,417,630,689
Cube361,799,053,434,337,260,113
Square root2,669.385135195≈irrational, shown to 9 decimal places
Cube root192.430610848≈
Negation-7,125,617
Reciprocal1.40338724 × 10^-7≈
Representations
Decimal7,125,617
Binary1101100101110100111000123 bits
Octal33135161
Hexadecimal6CBA71
Base 3648Q5T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, one hundred and twenty-five thousand, six hundred and seventeen
Ordinalseven million, one hundred and twenty-five thousand, six hundred and seventeenth
Scientific notation7.125617 × 10^6
Engineering notation7.125617 × 10^6
In other bases
Ternary111102000111202base 3; the most digit-efficient integer base after e: 15 digits
Quinary3311004432base 5; one hand: 10 digits
Septenary114365252base 7: 9 digits
Nonary14360452base 9; each digit is two ternary digits: 8 digits
Duodecimal2477755base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal24ae0hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal32:59:20:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11111T001TTTT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101111011100111110110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011011001011101001110001
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes36c ba 71
Gray code10110101110011101001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011011001011101001110001
64-bit0000000000000000000000000000000000000000011011001011101001110001
One's complement11111111100100110100010110001110at 32 bits, every bit flipped
Bits reversed10001110010111010011011000000000at 32 bits
Rotated left by 100000000110110010111010011100010at 32 bits, wrapping
Shifted left by 1110110010111010011100010= 14,251,234, no wrap
Shifted right by 11101100101110100111000= 3,562,808, discarding the low bit
These bits as a double3.52052257 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,125,617 to the power 250,774,417,630,689
7,125,617 to the power 3361,799,053,434,337,260,113
7,125,617 to the power 42,578,041,485,735,621,964,394,614,721
7,125,617 to the power 518,370,136,237,463,005,375,063,661,364,407,857
First ten multiples7,125,617, 14,251,234, 21,376,851, 28,502,468, 35,628,085, 42,753,702, 49,879,319, 57,004,936, 64,130,553, 71,256,170
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 17
Collatz (3n + 1) trajectory
Steps to reach 1297the total stopping time
Highest value reached31,273,8284× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,125,617 → 21,376,852 → 10,688,426 → 5,344,213 → 16,032,640 → 8,016,320 → 4,008,160 → 2,004,080 → 1,002,040 → 501,020 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage712,561,700%
7,125,617% as a decimal71,256.17
7,125,617% of 1007,125,617
7,125,617% of 1,00071,256,170
As a fraction of 1007,125,617/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 7,125,617
Nerdulate something else
Nothing in mind? Surprise me · today’s page