Recognised as Number
5,772,167
- Positive
- Odd
- Prime
- 7 digits
5,772,167 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,772,167
Digit count7
Digit sum35
Digit product20,580
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5,772,167
Distinct prime factors15,772,167
Number of divisors2
Sum of divisors σ(n)5,772,168
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,772,166integers below n that share no factor with it
Carmichael function λ(n)5,772,166the 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,1672 in total
Arithmetic
Previous number5,772,166
Next number5,772,168
Double11,544,334
Half2,886,083.5
Square33,317,911,875,889
Cube192,316,551,438,914,581,463
Square root2,402.533454502≈irrational, shown to 9 decimal places
Cube root179.382316957≈
Negation-5,772,167
Reciprocal1.73245161 × 10^-7≈
Representations
Decimal5,772,167
Binary1011000000100111000011123 bits
Octal26011607
Hexadecimal581387
Base 363FPTZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, seven hundred and seventy-two thousand, one hundred and sixty-seven
Ordinalfive million, seven hundred and seventy-two thousand, one hundred and sixty-seventh
Scientific notation5.772167 × 10^6
Engineering notation5.772167 × 10^6
In other bases
Ternary101212020220222base 3; the most digit-efficient integer base after e: 15 digits
Quinary2434202132base 5; one hand: 10 digits
Septenary100030322base 7: 9 digits
Nonary11766828base 9; each digit is two ternary digits: 8 digits
Duodecimal1b2445bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1g1a87base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal26:43:22:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T0TT1T10T100Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010000001010010011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010110000001001110000111
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
Bytes358 13 87
Gray code11101000001101001000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010110000001001110000111
64-bit0000000000000000000000000000000000000000010110000001001110000111
One's complement11111111101001111110110001111000at 32 bits, every bit flipped
Bits reversed11100001110010000001101000000000at 32 bits
Rotated left by 100000000101100000010011100001110at 32 bits, wrapping
Shifted left by 1101100000010011100001110= 11,544,334, no wrap
Shifted right by 11011000000100111000011= 2,886,083, discarding the low bit
These bits as a double2.85182942 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,772,167 to the power 233,317,911,875,889
5,772,167 to the power 3192,316,551,438,914,581,463
5,772,167 to the power 41,110,083,251,769,505,262,939,540,321
5,772,167 to the power 56,407,585,913,116,629,885,065,937,636,045,607
First ten multiples5,772,167, 11,544,334, 17,316,501, 23,088,668, 28,860,835, 34,633,002, 40,405,169, 46,177,336, 51,949,503, 57,721,670
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 11
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1183the total stopping time
Highest value reached38,962,1326× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,772,167 → 17,316,502 → 8,658,251 → 25,974,754 → 12,987,377 → 38,962,132 → 19,481,066 → 9,740,533 → 29,221,600 → 14,610,800 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage577,216,700%
5,772,167% as a decimal57,721.67
5,772,167% of 1005,772,167
5,772,167% of 1,00057,721,670
As a fraction of 1005,772,167/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 5,772,167
Nerdulate something else
Nothing in mind? Surprise me · today’s page