Recognised as Number
7,601,130
- Positive
- Even
- Composite
- 7 digits
7,601,130 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value7,601,130
Digit count7
Digit sum18
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3^2 × 5 × 84,457
Distinct prime factors42, 3, 5, 84,457
Number of divisors24
Sum of divisors σ(n)19,763,172
Aliquot sum12,162,042sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)2,026,944integers below n that share no factor with it
Carmichael function λ(n)84,456the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,026,944
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 84,457, 168,914, 253,371, 422,285, 506,742, 760,113, 844,570, 1,266,855, 1,520,226, 2,533,710, 3,800,565, 7,601,13024 in total
Arithmetic
Previous number7,601,129
Next number7,601,131
Double15,202,260
Half3,800,565
Square57,777,177,276,900
Cube439,171,835,514,762,897,000
Square root2,757.014689841≈irrational, shown to 9 decimal places
Cube root196.619258259≈
Negation-7,601,130
Reciprocal1.31559387 × 10^-7≈
Representations
Decimal7,601,130
Binary1110011111110111110101023 bits
Octal34775752
Hexadecimal73FBEA
Base 364IX2I
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, six hundred and one thousand, one hundred and thirty
Ordinalseven million, six hundred and one thousand, one hundred and thirtieth
Scientific notation7.60113 × 10^6
Engineering notation7.60113 × 10^6
In other bases
Ternary112022011210100base 3; the most digit-efficient integer base after e: 15 digits
Quinary3421214010base 5; one hand: 10 digits
Septenary121415505base 7: 9 digits
Nonary15264710base 9; each digit is two ternary digits: 8 digits
Duodecimal2666976base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal27a2gabase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal35:11:25:30base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT10T1TTT10100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101101000000110000111110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011100111111101111101010
Bit length23 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits6within that length
Bit parityodd17 set bits, so odd; not the same as the number itself being even
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes373 fb ea
Gray code10010100000011000011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011100111111101111101010
64-bit0000000000000000000000000000000000000000011100111111101111101010
One's complement11111111100011000000010000010101at 32 bits, every bit flipped
Bits reversed01010111110111111100111000000000at 32 bits
Rotated left by 100000000111001111111011111010100at 32 bits, wrapping
Shifted left by 1111001111111011111010100= 15,202,260, no wrap
Shifted right by 11110011111110111110101= 3,800,565, discarding the low bit
These bits as a double3.7554572 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,601,130 to the power 257,777,177,276,900
7,601,130 to the power 3439,171,835,514,762,897,000
7,601,130 to the power 43,338,202,214,086,329,699,273,610,000
7,601,130 to the power 525,374,108,995,558,023,267,039,615,179,300,000
First ten multiples7,601,130, 15,202,260, 22,803,390, 30,404,520, 38,005,650, 45,606,780, 53,207,910, 60,809,040, 68,410,170, 76,011,300
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10Yes
Divisible by 11No, remainder 9
Divisible by 12No, remainder 6
Divisible by 100No, remainder 30
Collatz (3n + 1) trajectory
Steps to reach 1129the total stopping time
Highest value reached11,401,6961× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,601,130 → 3,800,565 → 11,401,696 → 5,700,848 → 2,850,424 → 1,425,212 → 712,606 → 356,303 → 1,068,910 → 534,455 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage760,113,000%
7,601,130% as a decimal76,011.3
7,601,130% of 1007,601,130
7,601,130% of 1,00076,011,300
As a fraction of 1007,601,130/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,601,130
Nerdulate something else
Nothing in mind? Surprise me · today’s page