Nerdulator> put something in

Recognised as Number

8,328,161

  • Positive
  • Odd
  • Prime
  • 7 digits

8,328,161 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 value8,328,161
Digit count7
Digit sum29
Digit product2,304
Multiplicative persistence2times 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 factorisation8,328,161
Distinct prime factors18,328,161
Number of divisors2
Sum of divisors σ(n)8,328,162
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,328,160integers below n that share no factor with it
Carmichael function λ(n)8,328,160the 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, 8,328,1612 in total

Arithmetic

Previous number8,328,160
Next number8,328,162
Cube577,626,802,946,686,437,281
Square root2,885.855332479≈irrational, shown to 9 decimal places
Cube root202.69811227≈
Negation-8,328,161
Reciprocal1.20074528 × 10^-7≈

Representations

Decimal8,328,161
Binary1111111000100111110000123 bits
Octal37611741
Hexadecimal7F13E1
Base 364YI1T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, three hundred and twenty-eight thousand, one hundred and sixty-one
Ordinaleight million, three hundred and twenty-eight thousand, one hundred and sixty-first
Scientific notation8.328161 × 10^6
Engineering notation8.328161 × 10^6

In other bases

Ternary120200010002102base 3; the most digit-efficient integer base after e: 15 digits
Quinary4113000121base 5; one hand: 10 digits
Septenary130534232base 7: 9 digits
Nonary16603072base 9; each digit is two ternary digits: 8 digits
Duodecimal2957655base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2c1081base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal38:33:22:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT1T0001001T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100000110001010000100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000011111110001001111100001
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
Bytes37f 13 e1
Gray code10000001001101000010001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000011111110001001111100001
64-bit0000000000000000000000000000000000000000011111110001001111100001
One's complement11111111100000001110110000011110at 32 bits, every bit flipped
Bits reversed10000111110010001111111000000000at 32 bits
Rotated left by 100000000111111100010011111000010at 32 bits, wrapping
Shifted left by 1111111100010011111000010= 16,656,322, no wrap
Shifted right by 11111111000100111110000= 4,164,080, discarding the low bit
These bits as a double4.11465824 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime8,328,169+8
Previous prime8,328,127−34
Distance to nearest prime0, it is prime
Nearest square below8,323,225
Nearest square above8,328,996

Powers & multiples

8,328,161 to the power 269,358,265,641,921
8,328,161 to the power 3577,626,802,946,686,437,281
8,328,161 to the power 44,810,569,012,855,279,066,192,570,241
8,328,161 to the power 540,063,193,240,669,833,763,181,381,970,856,801
First ten multiples8,328,161, 16,656,322, 24,984,483, 33,312,644, 41,640,805, 49,968,966, 58,297,127, 66,625,288, 74,953,449, 83,281,610
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 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 1199the total stopping time
Highest value reached47,431,4925× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,328,161 → 24,984,484 → 12,492,242 → 6,246,121 → 18,738,364 → 9,369,182 → 4,684,591 → 14,053,774 → 7,026,887 → 21,080,662 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage832,816,100%
8,328,161% as a decimal83,281.61
8,328,161% of 1008,328,161
8,328,161% of 1,00083,281,610
As a fraction of 1008,328,161/100

Read another way

As bytes7.942 MiB
As a 24-bit colour#7F13E1

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