Recognised as Number
7,697,003
- Positive
- Odd
- Prime
- 7 digits
7,697,003 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,697,003
Digit count7
Digit sum32
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,697,003
Distinct prime factors17,697,003
Number of divisors2
Sum of divisors σ(n)7,697,004
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,697,002integers below n that share no factor with it
Carmichael function λ(n)7,697,002the 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,697,0032 in total
Arithmetic
Previous number7,697,002
Next number7,697,004
Double15,394,006
Half3,848,501.5
Square59,243,855,182,009
Cube456,000,131,067,488,819,027
Square root2,774.34731063≈irrational, shown to 9 decimal places
Cube root197.442459336≈
Negation-7,697,003
Reciprocal1.29920698 × 10^-7≈
Representations
Decimal7,697,003
Binary1110101011100100110101123 bits
Octal35271153
Hexadecimal75726B
Base 364KZ1N
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, six hundred and ninety-seven thousand and three
Ordinalseven million, six hundred and ninety-seven thousand and third
Scientific notation7.697003 × 10^6
Engineering notation7.697003 × 10^6
In other bases
Ternary112111001022012base 3; the most digit-efficient integer base after e: 15 digits
Quinary3432301003base 5; one hand: 10 digits
Septenary122265146base 7: 9 digits
Nonary15431265base 9; each digit is two ternary digits: 8 digits
Duodecimal26b234bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2822a3base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal35:38:3:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT11100110T1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100010101011011110111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011101010111001001101011
Bit length23 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits9within that length
Bit parityeven14 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
Bytes375 72 6b
Gray code10011111100101101011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011101010111001001101011
64-bit0000000000000000000000000000000000000000011101010111001001101011
One's complement11111111100010101000110110010100at 32 bits, every bit flipped
Bits reversed11010110010011101010111000000000at 32 bits
Rotated left by 100000000111010101110010011010110at 32 bits, wrapping
Shifted left by 1111010101110010011010110= 15,394,006, no wrap
Shifted right by 11110101011100100110101= 3,848,501, discarding the low bit
These bits as a double3.80282476 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,697,003 to the power 259,243,855,182,009
7,697,003 to the power 3456,000,131,067,488,819,027
7,697,003 to the power 43,509,834,376,826,854,642,517,276,081
7,697,003 to the power 527,015,205,727,939,430,664,019,401,547,285,243
First ten multiples7,697,003, 15,394,006, 23,091,009, 30,788,012, 38,485,015, 46,182,018, 53,879,021, 61,576,024, 69,273,027, 76,970,030
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 11
Divisible by 100No, remainder 3
Collatz (3n + 1) trajectory
Steps to reach 1235the total stopping time
Highest value reached34,636,5164× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,697,003 → 23,091,010 → 11,545,505 → 34,636,516 → 17,318,258 → 8,659,129 → 25,977,388 → 12,988,694 → 6,494,347 → 19,483,042 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage769,700,300%
7,697,003% as a decimal76,970.03
7,697,003% of 1007,697,003
7,697,003% of 1,00076,970,030
As a fraction of 1007,697,003/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,697,003
Nerdulate something else
Nothing in mind? Surprise me · today’s page