Nerdulator> put something in

Recognised as Number

7,601,131

  • Positive
  • Odd
  • Prime
  • 7 digits

7,601,131 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,601,131
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7,601,131
Distinct prime factors17,601,131
Number of divisors2
Sum of divisors σ(n)7,601,132
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,601,130integers below n that share no factor with it
Carmichael function λ(n)7,601,130the 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,1312 in total

Arithmetic

Previous number7,601,130
Next number7,601,132
Cube439,172,008,846,317,531,091
Square root2,757.014871197≈irrational, shown to 9 decimal places
Cube root196.619266881≈
Negation-7,601,131
Reciprocal1.31559369 × 10^-7≈

Representations

Decimal7,601,131
Binary1110011111110111110101123 bits
Octal34775753
Hexadecimal73FBEB
Base 364IX2J
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, six hundred and one thousand, one hundred and thirty-one
Ordinalseven million, six hundred and one thousand, one hundred and thirty-first
Scientific notation7.601131 × 10^6
Engineering notation7.601131 × 10^6

In other bases

Ternary112022011210101base 3; the most digit-efficient integer base after e: 15 digits
Quinary3421214011base 5; one hand: 10 digits
Septenary121415506base 7: 9 digits
Nonary15264711base 9; each digit is two ternary digits: 8 digits
Duodecimal2666977base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal27a2gbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal35:11:25:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT10T1TTT10101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101101000000110000111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000011100111111101111101011
Bit length23 bitsto write the magnitude
Set bits18the population count, or Hamming weight
Zero bits5within that length
Bit parityeven18 set bits, so even; 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 eb
Gray code10010100000011000011110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000011100111111101111101011
64-bit0000000000000000000000000000000000000000011100111111101111101011
One's complement11111111100011000000010000010100at 32 bits, every bit flipped
Bits reversed11010111110111111100111000000000at 32 bits
Rotated left by 100000000111001111111011111010110at 32 bits, wrapping
Shifted left by 1111001111111011111010110= 15,202,262, no wrap
Shifted right by 11110011111110111110101= 3,800,565, discarding the low bit
These bits as a double3.7554577 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime7,601,137+6
Previous prime7,601,123−8
Distance to nearest prime0, it is prime
Nearest square below7,601,049
Nearest square above7,606,564

Powers & multiples

7,601,131 to the power 257,777,192,479,161
7,601,131 to the power 3439,172,008,846,317,531,091
7,601,131 to the power 43,338,203,970,774,018,421,419,263,921
7,601,131 to the power 525,374,125,686,573,485,417,621,030,987,094,651
First ten multiples7,601,131, 15,202,262, 22,803,393, 30,404,524, 38,005,655, 45,606,786, 53,207,917, 60,809,048, 68,410,179, 76,011,310
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 185the total stopping time
Highest value reached64,936,2408× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,601,131 → 22,803,394 → 11,401,697 → 34,205,092 → 17,102,546 → 8,551,273 → 25,653,820 → 12,826,910 → 6,413,455 → 19,240,366 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage760,113,100%
7,601,131% as a decimal76,011.31
7,601,131% of 1007,601,131
7,601,131% of 1,00076,011,310
As a fraction of 1007,601,131/100

Read another way

As bytes7.249 MiB
As a 24-bit colour#73FBEB

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “7601131” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.