Recognised as Number
7,631,489
- Positive
- Odd
- Prime
- 7 digits
7,631,489 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,631,489
Digit count7
Digit sum38
Digit product36,288
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,631,489
Distinct prime factors17,631,489
Number of divisors2
Sum of divisors σ(n)7,631,490
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,631,488integers below n that share no factor with it
Carmichael function λ(n)7,631,488the 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,631,4892 in total
Arithmetic
Previous number7,631,488
Next number7,631,490
Double15,262,978
Half3,815,744.5
Square58,239,624,357,121
Cube444,455,052,645,500,983,169
Square root2,762.514977335≈irrational, shown to 9 decimal places
Cube root196.880677051≈
Negation-7,631,489
Reciprocal1.31036027 × 10^-7≈
Representations
Decimal7,631,489
Binary1110100011100101000000123 bits
Octal35071201
Hexadecimal747281
Base 364JKHT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, six hundred and thirty-one thousand, four hundred and eighty-nine
Ordinalseven million, six hundred and thirty-one thousand, four hundred and eighty-ninth
Scientific notation7.631489 × 10^6
Engineering notation7.631489 × 10^6
In other bases
Ternary112100201102202base 3; the most digit-efficient integer base after e: 15 digits
Quinary3423201424base 5; one hand: 10 digits
Septenary121603145base 7: 9 digits
Nonary15321382base 9; each digit is two ternary digits: 8 digits
Duodecimal2680455base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal27die9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal35:19:51:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT101T01110T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101101011011011110000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011101000111001010000001
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 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
Bytes374 72 81
Gray code10011100100101111000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011101000111001010000001
64-bit0000000000000000000000000000000000000000011101000111001010000001
One's complement11111111100010111000110101111110at 32 bits, every bit flipped
Bits reversed10000001010011100010111000000000at 32 bits
Rotated left by 100000000111010001110010100000010at 32 bits, wrapping
Shifted left by 1111010001110010100000010= 15,262,978, no wrap
Shifted right by 11110100011100101000000= 3,815,744, discarding the low bit
These bits as a double3.77045654 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,631,489 to the power 258,239,624,357,121
7,631,489 to the power 3444,455,052,645,500,983,169
7,631,489 to the power 43,391,853,845,258,561,652,543,408,641
7,631,489 to the power 525,884,895,309,698,415,407,206,845,066,296,449
First ten multiples7,631,489, 15,262,978, 22,894,467, 30,525,956, 38,157,445, 45,788,934, 53,420,423, 61,051,912, 68,683,401, 76,314,890
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1155the total stopping time
Highest value reached32,597,8004× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,631,489 → 22,894,468 → 11,447,234 → 5,723,617 → 17,170,852 → 8,585,426 → 4,292,713 → 12,878,140 → 6,439,070 → 3,219,535 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage763,148,900%
7,631,489% as a decimal76,314.89
7,631,489% of 1007,631,489
7,631,489% of 1,00076,314,890
As a fraction of 1007,631,489/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,631,489
Nerdulate something else
Nothing in mind? Surprise me · today’s page