Recognised as Number
7,601,137
- Positive
- Odd
- Prime
- 7 digits
7,601,137 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,601,137
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,601,137
Distinct prime factors17,601,137
Number of divisors2
Sum of divisors σ(n)7,601,138
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,601,136integers below n that share no factor with it
Carmichael function λ(n)7,601,136the 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,601,1372 in total
Arithmetic
Previous number7,601,136
Next number7,601,138
Double15,202,274
Half3,800,568.5
Square57,777,283,692,769
Cube439,173,048,836,603,078,353
Square root2,757.01595933≈irrational, shown to 9 decimal places
Cube root196.619318615≈
Negation-7,601,137
Reciprocal1.31559265 × 10^-7≈
Representations
Decimal7,601,137
Binary1110011111110111111000123 bits
Octal34775761
Hexadecimal73FBF1
Base 364IX2P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, six hundred and one thousand, one hundred and thirty-seven
Ordinalseven million, six hundred and one thousand, one hundred and thirty-seventh
Scientific notation7.601137 × 10^6
Engineering notation7.601137 × 10^6
In other bases
Ternary112022011210121base 3; the most digit-efficient integer base after e: 15 digits
Quinary3421214022base 5; one hand: 10 digits
Septenary121415515base 7: 9 digits
Nonary15264717base 9; each digit is two ternary digits: 8 digits
Duodecimal2666981base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal27a2ghbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal35:11:25:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT10T1TTT11TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101101000000110000110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011100111111101111110001
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 odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes373 fb f1
Gray code10010100000011000001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011100111111101111110001
64-bit0000000000000000000000000000000000000000011100111111101111110001
One's complement11111111100011000000010000001110at 32 bits, every bit flipped
Bits reversed10001111110111111100111000000000at 32 bits
Rotated left by 100000000111001111111011111100010at 32 bits, wrapping
Shifted left by 1111001111111011111100010= 15,202,274, no wrap
Shifted right by 11110011111110111111000= 3,800,568, discarding the low bit
These bits as a double3.75546066 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,601,137 to the power 257,777,283,692,769
7,601,137 to the power 3439,173,048,836,603,078,353
7,601,137 to the power 43,338,214,510,914,710,613,182,887,361
7,601,137 to the power 525,374,225,832,850,710,686,157,132,886,529,457
First ten multiples7,601,137, 15,202,274, 22,803,411, 30,404,548, 38,005,685, 45,606,822, 53,207,959, 60,809,096, 68,410,233, 76,011,370
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 1129the total stopping time
Highest value reached22,803,4123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,601,137 → 22,803,412 → 11,401,706 → 5,700,853 → 17,102,560 → 8,551,280 → 4,275,640 → 2,137,820 → 1,068,910 → 534,455 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage760,113,700%
7,601,137% as a decimal76,011.37
7,601,137% of 1007,601,137
7,601,137% of 1,00076,011,370
As a fraction of 1007,601,137/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,137
Nerdulate something else
Nothing in mind? Surprise me · today’s page