Nerdulator> put something in

Recognised as Number

5,772,161

  • Positive
  • Odd
  • Prime
  • 7 digits

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

Arithmetic

Previous number5,772,160
Next number5,772,162
Cube192,315,951,717,124,209,281
Square root2,402.53220582≈irrational, shown to 9 decimal places
Cube root179.382254803≈
Negation-5,772,161
Reciprocal1.73245341 × 10^-7≈

Representations

Decimal5,772,161
Binary1011000000100111000000123 bits
Octal26011601
Hexadecimal581381
Base 363FPTT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, seven hundred and seventy-two thousand, one hundred and sixty-one
Ordinalfive million, seven hundred and seventy-two thousand, one hundred and sixty-first
Scientific notation5.772161 × 10^6
Engineering notation5.772161 × 10^6

In other bases

Ternary101212020220202base 3; the most digit-efficient integer base after e: 15 digits
Quinary2434202121base 5; one hand: 10 digits
Septenary100030313base 7: 9 digits
Nonary11766822base 9; each digit is two ternary digits: 8 digits
Duodecimal1b24455base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1g1a81base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal26:43:22:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T0TT1T10T1T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010000001010010000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010110000001001110000001
Bit length23 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits15within that length
Bit parityeven8 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
Bytes358 13 81
Gray code11101000001101001000001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010110000001001110000001
64-bit0000000000000000000000000000000000000000010110000001001110000001
One's complement11111111101001111110110001111110at 32 bits, every bit flipped
Bits reversed10000001110010000001101000000000at 32 bits
Rotated left by 100000000101100000010011100000010at 32 bits, wrapping
Shifted left by 1101100000010011100000010= 11,544,322, no wrap
Shifted right by 11011000000100111000000= 2,886,080, discarding the low bit
These bits as a double2.85182645 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime5,772,167+6
Previous prime5,772,157−4
Distance to nearest prime0, it is prime
Nearest square below5,769,604
Nearest square above5,774,409

Powers & multiples

5,772,161 to the power 233,317,842,609,921
5,772,161 to the power 3192,315,951,717,124,209,281
5,772,161 to the power 41,110,078,636,179,467,392,967,626,241
5,772,161 to the power 56,407,552,610,688,310,686,459,406,450,876,801
First ten multiples5,772,161, 11,544,322, 17,316,483, 23,088,644, 28,860,805, 34,632,966, 40,405,127, 46,177,288, 51,949,449, 57,721,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 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
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 1183the total stopping time
Highest value reached17,316,4843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,772,161 → 17,316,484 → 8,658,242 → 4,329,121 → 12,987,364 → 6,493,682 → 3,246,841 → 9,740,524 → 4,870,262 → 2,435,131 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage577,216,100%
5,772,161% as a decimal57,721.61
5,772,161% of 1005,772,161
5,772,161% of 1,00057,721,610
As a fraction of 1005,772,161/100

Read another way

As bytes5.505 MiB
As a 24-bit colour#581381

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