Recognised as Number
7,610,201
- Positive
- Odd
- Prime
- 7 digits
7,610,201 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,610,201
Digit count7
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,610,201
Distinct prime factors17,610,201
Number of divisors2
Sum of divisors σ(n)7,610,202
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,610,200integers below n that share no factor with it
Carmichael function λ(n)7,610,200the 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,610,2012 in total
Arithmetic
Previous number7,610,200
Next number7,610,202
Double15,220,402
Half3,805,100.5
Square57,915,159,260,401
Cube440,746,002,918,662,950,601
Square root2,758.659275808≈irrational, shown to 9 decimal places
Cube root196.697440682≈
Negation-7,610,201
Reciprocal1.31402574 × 10^-7≈
Representations
Decimal7,610,201
Binary1110100000111110101100123 bits
Octal35017531
Hexadecimal741F59
Base 364J42H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, six hundred and ten thousand, two hundred and one
Ordinalseven million, six hundred and ten thousand, two hundred and first
Scientific notation7.610201 × 10^6
Engineering notation7.610201 × 10^6
In other bases
Ternary112022122020022base 3; the most digit-efficient integer base after e: 15 digits
Quinary3422011301base 5; one hand: 10 digits
Septenary121454114base 7: 9 digits
Nonary15278208base 9; each digit is two ternary digits: 8 digits
Duodecimal2670075base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal27b5a1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal35:13:56:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT100T0T1T010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101101000110000010101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011101000001111101011001
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
Bytes374 1f 59
Gray code10011100001000011110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011101000001111101011001
64-bit0000000000000000000000000000000000000000011101000001111101011001
One's complement11111111100010111110000010100110at 32 bits, every bit flipped
Bits reversed10011010111110000010111000000000at 32 bits
Rotated left by 100000000111010000011111010110010at 32 bits, wrapping
Shifted left by 1111010000011111010110010= 15,220,402, no wrap
Shifted right by 11110100000111110101100= 3,805,100, discarding the low bit
These bits as a double3.75993887 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,610,201 to the power 257,915,159,260,401
7,610,201 to the power 3440,746,002,918,662,950,601
7,610,201 to the power 43,354,165,672,157,611,705,326,680,801
7,610,201 to the power 525,525,874,952,419,528,757,488,811,558,451,001
First ten multiples7,610,201, 15,220,402, 22,830,603, 30,440,804, 38,051,005, 45,661,206, 53,271,407, 60,881,608, 68,491,809, 76,102,010
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1103the total stopping time
Highest value reached25,684,4323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,610,201 → 22,830,604 → 11,415,302 → 5,707,651 → 17,122,954 → 8,561,477 → 25,684,432 → 12,842,216 → 6,421,108 → 3,210,554 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage761,020,100%
7,610,201% as a decimal76,102.01
7,610,201% of 1007,610,201
7,610,201% of 1,00076,102,010
As a fraction of 1007,610,201/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,610,201
Nerdulate something else
Nothing in mind? Surprise me · today’s page