Nerdulator> put something in

Recognised as Number

9,768,461

  • Positive
  • Odd
  • Prime
  • 7 digits

9,768,461 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 value9,768,461
Digit count7
Digit sum41
Digit product72,576
Multiplicative persistence3times 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 factorisation9,768,461
Distinct prime factors19,768,461
Number of divisors2
Sum of divisors σ(n)9,768,462
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,768,460integers below n that share no factor with it
Carmichael function λ(n)9,768,460the 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, 9,768,4612 in total

Arithmetic

Previous number9,768,460
Next number9,768,462
Cube932,134,196,378,405,356,181
Square root3,125.453727061≈irrational, shown to 9 decimal places
Cube root213.767682497≈
Negation-9,768,461
Reciprocal1.02370271 × 10^-7≈

Representations

Decimal9,768,461
Binary10010101000011100000110124 bits
Octal45207015
Hexadecimal950E0D
Base 365TDE5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, seven hundred and sixty-eight thousand, four hundred and sixty-one
Ordinalnine million, seven hundred and sixty-eight thousand, four hundred and sixty-first
Scientific notation9.768461 × 10^6
Engineering notation9.768461 × 10^6

In other bases

Ternary200101021210212base 3; the most digit-efficient integer base after e: 15 digits
Quinary10000042321base 5; one hand: 11 digits
Septenary146013323base 7: 9 digits
Nonary20337725base 9; each digit is two ternary digits: 8 digits
Duodecimal3331065base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal311131base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal45:13:27:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0010110TT110TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100101010001001000011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000100101010000111000001101
Bit length24 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits14within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes395 0e 0d
Gray code110111111000100100001011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000100101010000111000001101
64-bit0000000000000000000000000000000000000000100101010000111000001101
One's complement11111111011010101111000111110010at 32 bits, every bit flipped
Bits reversed10110000011100001010100100000000at 32 bits
Rotated left by 100000001001010100001110000011010at 32 bits, wrapping
Shifted left by 11001010100001110000011010= 19,536,922, no wrap
Shifted right by 110010101000011100000110= 4,884,230, discarding the low bit
These bits as a double4.82626099 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime9,768,469+8
Previous prime9,768,449−12
Distance to nearest prime0, it is prime
Nearest square below9,765,625
Nearest square above9,771,876

Powers & multiples

9,768,461 to the power 295,422,830,308,521
9,768,461 to the power 3932,134,196,378,405,356,181
9,768,461 to the power 49,105,516,544,088,793,964,045,207,441
9,768,461 to the power 588,946,883,245,786,164,374,811,011,124,318,301
First ten multiples9,768,461, 19,536,922, 29,305,383, 39,073,844, 48,842,305, 58,610,766, 68,379,227, 78,147,688, 87,916,149, 97,684,610
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

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 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time
Highest value reached29,305,3843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,768,461 → 29,305,384 → 14,652,692 → 7,326,346 → 3,663,173 → 10,989,520 → 5,494,760 → 2,747,380 → 1,373,690 → 686,845 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage976,846,100%
9,768,461% as a decimal97,684.61
9,768,461% of 1009,768,461
9,768,461% of 1,00097,684,610
As a fraction of 1009,768,461/100

Read another way

As bytes9.316 MiB
As a 24-bit colour#950E0D

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 “9768461” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.